./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:33:46,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:33:46,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:33:46,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:33:46,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:33:46,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:33:46,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:33:46,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:33:46,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:33:46,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:33:46,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:33:46,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:33:46,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:33:46,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:33:46,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:33:46,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:33:46,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:33:46,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:33:46,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:33:46,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:33:46,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:33:46,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:33:46,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:33:46,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:33:46,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:33:46,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:33:46,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:33:46,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:33:46,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:33:46,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:33:46,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:33:46,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:33:46,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:33:46,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:33:46,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:33:46,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:33:46,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:33:46,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:33:46,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:33:46,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:33:46,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:33:46,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:33:46,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e [2024-10-11 16:33:47,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:33:47,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:33:47,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:33:47,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:33:47,238 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:33:47,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2024-10-11 16:33:48,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:33:48,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:33:48,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2024-10-11 16:33:48,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0e95fdda1/9edc33f2dd434e7b922204e9901a837a/FLAG3cb9173b1 [2024-10-11 16:33:48,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0e95fdda1/9edc33f2dd434e7b922204e9901a837a [2024-10-11 16:33:48,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:33:48,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:33:48,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:33:48,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:33:48,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:33:48,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:33:48" (1/1) ... [2024-10-11 16:33:48,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3598470d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:48, skipping insertion in model container [2024-10-11 16:33:48,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:33:48" (1/1) ... [2024-10-11 16:33:49,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:33:49,466 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] [2024-10-11 16:33:49,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:33:49,684 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:33:49,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i[33022,33035] [2024-10-11 16:33:49,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:33:49,864 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:33:49,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49 WrapperNode [2024-10-11 16:33:49,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:33:49,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:33:49,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:33:49,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:33:49,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:49,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,036 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3410 [2024-10-11 16:33:50,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:33:50,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:33:50,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:33:50,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:33:50,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,301 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-10-11 16:33:50,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:33:50,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:33:50,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:33:50,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:33:50,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (1/1) ... [2024-10-11 16:33:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:33:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:33:50,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:33:50,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:33:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 16:33:50,523 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 16:33:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:33:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:33:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:33:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:33:50,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:33:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:33:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:33:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:33:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:33:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:33:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:33:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:33:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:33:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:33:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:33:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:33:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:33:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:33:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:33:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:33:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:33:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:33:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:33:50,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:33:50,815 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:33:50,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:33:53,412 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2024-10-11 16:33:53,412 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:33:53,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:33:53,477 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-11 16:33:53,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:33:53 BoogieIcfgContainer [2024-10-11 16:33:53,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:33:53,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:33:53,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:33:53,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:33:53,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:33:48" (1/3) ... [2024-10-11 16:33:53,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f1a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:33:53, skipping insertion in model container [2024-10-11 16:33:53,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:33:49" (2/3) ... [2024-10-11 16:33:53,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f1a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:33:53, skipping insertion in model container [2024-10-11 16:33:53,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:33:53" (3/3) ... [2024-10-11 16:33:53,486 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2024-10-11 16:33:53,501 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:33:53,501 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:33:53,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:33:53,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7451cfd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:33:53,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:33:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 1025 states, 1006 states have (on average 1.6312127236580516) internal successors, (1641), 1011 states have internal predecessors, (1641), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 16:33:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 16:33:53,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:53,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:53,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 76532746, now seen corresponding path program 1 times [2024-10-11 16:33:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456104830] [2024-10-11 16:33:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:33:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456104830] [2024-10-11 16:33:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456104830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:53,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:33:53,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681035057] [2024-10-11 16:33:53,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:53,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:33:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:33:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:33:53,849 INFO L87 Difference]: Start difference. First operand has 1025 states, 1006 states have (on average 1.6312127236580516) internal successors, (1641), 1011 states have internal predecessors, (1641), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:53,982 INFO L93 Difference]: Finished difference Result 2049 states and 3345 transitions. [2024-10-11 16:33:53,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:33:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 16:33:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:54,006 INFO L225 Difference]: With dead ends: 2049 [2024-10-11 16:33:54,006 INFO L226 Difference]: Without dead ends: 1023 [2024-10-11 16:33:54,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:33:54,016 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:54,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1506 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:33:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-10-11 16:33:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2024-10-11 16:33:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:33:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2024-10-11 16:33:54,110 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 12 [2024-10-11 16:33:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2024-10-11 16:33:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2024-10-11 16:33:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:33:54,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:54,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:33:54,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:54,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1351663222, now seen corresponding path program 1 times [2024-10-11 16:33:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170399165] [2024-10-11 16:33:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:33:54,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:54,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170399165] [2024-10-11 16:33:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170399165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:33:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716306961] [2024-10-11 16:33:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:54,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:33:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:33:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:54,639 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:54,836 INFO L93 Difference]: Finished difference Result 2042 states and 3012 transitions. [2024-10-11 16:33:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:33:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 16:33:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:54,845 INFO L225 Difference]: With dead ends: 2042 [2024-10-11 16:33:54,846 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:33:54,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:33:54,850 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 548 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:54,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 4525 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:33:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:33:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1025. [2024-10-11 16:33:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4726911618669314) internal successors, (1483), 1012 states have internal predecessors, (1483), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:33:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1510 transitions. [2024-10-11 16:33:54,892 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1510 transitions. Word has length 67 [2024-10-11 16:33:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:54,892 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1510 transitions. [2024-10-11 16:33:54,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1510 transitions. [2024-10-11 16:33:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 16:33:54,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:54,899 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:54,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:33:54,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:54,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 24463117, now seen corresponding path program 1 times [2024-10-11 16:33:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:54,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745713524] [2024-10-11 16:33:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:33:55,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:55,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745713524] [2024-10-11 16:33:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745713524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:55,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:55,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:33:55,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879147045] [2024-10-11 16:33:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:55,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:33:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:33:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:55,444 INFO L87 Difference]: Start difference. First operand 1025 states and 1510 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:55,610 INFO L93 Difference]: Finished difference Result 2431 states and 3576 transitions. [2024-10-11 16:33:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:33:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-11 16:33:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:55,617 INFO L225 Difference]: With dead ends: 2431 [2024-10-11 16:33:55,617 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:33:55,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:33:55,621 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 544 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:55,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4439 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:33:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:33:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1028. [2024-10-11 16:33:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1010 states have (on average 1.4712871287128713) internal successors, (1486), 1015 states have internal predecessors, (1486), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:33:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1513 transitions. [2024-10-11 16:33:55,650 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1513 transitions. Word has length 144 [2024-10-11 16:33:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:55,651 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1513 transitions. [2024-10-11 16:33:55,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1513 transitions. [2024-10-11 16:33:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:33:55,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:55,655 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:33:55,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 532320615, now seen corresponding path program 1 times [2024-10-11 16:33:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881578965] [2024-10-11 16:33:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:33:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881578965] [2024-10-11 16:33:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881578965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:33:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141507525] [2024-10-11 16:33:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:56,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:33:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:33:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:56,063 INFO L87 Difference]: Start difference. First operand 1028 states and 1513 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:56,189 INFO L93 Difference]: Finished difference Result 2008 states and 2954 transitions. [2024-10-11 16:33:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:33:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:33:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:56,194 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 16:33:56,194 INFO L226 Difference]: Without dead ends: 986 [2024-10-11 16:33:56,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:33:56,197 INFO L432 NwaCegarLoop]: 1403 mSDtfsCounter, 30 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:56,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4192 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:33:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-10-11 16:33:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2024-10-11 16:33:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 968 states have (on average 1.4555785123966942) internal successors, (1409), 973 states have internal predecessors, (1409), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:33:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1436 transitions. [2024-10-11 16:33:56,220 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1436 transitions. Word has length 215 [2024-10-11 16:33:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:56,220 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1436 transitions. [2024-10-11 16:33:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1436 transitions. [2024-10-11 16:33:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:33:56,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:56,223 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:33:56,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1783554395, now seen corresponding path program 1 times [2024-10-11 16:33:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215678589] [2024-10-11 16:33:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:33:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215678589] [2024-10-11 16:33:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215678589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:56,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:33:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971792606] [2024-10-11 16:33:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:56,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:33:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:33:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:33:56,464 INFO L87 Difference]: Start difference. First operand 986 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:56,565 INFO L93 Difference]: Finished difference Result 2497 states and 3649 transitions. [2024-10-11 16:33:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:33:56,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:33:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:56,571 INFO L225 Difference]: With dead ends: 2497 [2024-10-11 16:33:56,572 INFO L226 Difference]: Without dead ends: 1517 [2024-10-11 16:33:56,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:33:56,574 INFO L432 NwaCegarLoop]: 1420 mSDtfsCounter, 716 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:56,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2823 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:33:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-11 16:33:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1358. [2024-10-11 16:33:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1338 states have (on average 1.4581464872944694) internal successors, (1951), 1343 states have internal predecessors, (1951), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:33:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1982 transitions. [2024-10-11 16:33:56,609 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1982 transitions. Word has length 215 [2024-10-11 16:33:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1982 transitions. [2024-10-11 16:33:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:33:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1982 transitions. [2024-10-11 16:33:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:33:56,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:56,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:56,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:33:56,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 707293014, now seen corresponding path program 1 times [2024-10-11 16:33:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57074586] [2024-10-11 16:33:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:33:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:33:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:33:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57074586] [2024-10-11 16:33:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57074586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:33:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626264776] [2024-10-11 16:33:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:33:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:33:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:33:57,101 INFO L87 Difference]: Start difference. First operand 1358 states and 1982 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:57,587 INFO L93 Difference]: Finished difference Result 2585 states and 3784 transitions. [2024-10-11 16:33:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:33:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:33:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:57,593 INFO L225 Difference]: With dead ends: 2585 [2024-10-11 16:33:57,594 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:33:57,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:33:57,598 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 51 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:57,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 5038 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:33:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:33:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:33:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4459876543209877) internal successors, (1874), 1301 states have internal predecessors, (1874), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:33:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1905 transitions. [2024-10-11 16:33:57,630 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1905 transitions. Word has length 228 [2024-10-11 16:33:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:57,632 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1905 transitions. [2024-10-11 16:33:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1905 transitions. [2024-10-11 16:33:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:33:57,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:57,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:57,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:33:57,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:57,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 331486050, now seen corresponding path program 1 times [2024-10-11 16:33:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468018063] [2024-10-11 16:33:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:33:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:33:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:33:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468018063] [2024-10-11 16:33:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468018063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:57,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:33:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034486087] [2024-10-11 16:33:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:33:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:33:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:58,001 INFO L87 Difference]: Start difference. First operand 1316 states and 1905 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:58,518 INFO L93 Difference]: Finished difference Result 2543 states and 3696 transitions. [2024-10-11 16:33:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:33:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:33:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:58,525 INFO L225 Difference]: With dead ends: 2543 [2024-10-11 16:33:58,525 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:33:58,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:58,528 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 22 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:58,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3782 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:33:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:33:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:33:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4436728395061729) internal successors, (1871), 1301 states have internal predecessors, (1871), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:33:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1902 transitions. [2024-10-11 16:33:58,558 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1902 transitions. Word has length 228 [2024-10-11 16:33:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1902 transitions. [2024-10-11 16:33:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1902 transitions. [2024-10-11 16:33:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:33:58,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:58,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:58,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:33:58,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:58,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1395658912, now seen corresponding path program 1 times [2024-10-11 16:33:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506073733] [2024-10-11 16:33:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:58,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:33:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:33:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:33:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506073733] [2024-10-11 16:33:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506073733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:33:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215845739] [2024-10-11 16:33:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:33:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:33:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:58,907 INFO L87 Difference]: Start difference. First operand 1316 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:33:59,382 INFO L93 Difference]: Finished difference Result 3114 states and 4524 transitions. [2024-10-11 16:33:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:33:59,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:33:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:33:59,391 INFO L225 Difference]: With dead ends: 3114 [2024-10-11 16:33:59,391 INFO L226 Difference]: Without dead ends: 1889 [2024-10-11 16:33:59,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:33:59,394 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 617 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:33:59,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 4237 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:33:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-10-11 16:33:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1882. [2024-10-11 16:33:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1856 states have (on average 1.4455818965517242) internal successors, (2683), 1861 states have internal predecessors, (2683), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:33:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2726 transitions. [2024-10-11 16:33:59,440 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2726 transitions. Word has length 228 [2024-10-11 16:33:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:33:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2726 transitions. [2024-10-11 16:33:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:33:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2726 transitions. [2024-10-11 16:33:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 16:33:59,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:33:59,444 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:33:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:33:59,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:33:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:33:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1828790174, now seen corresponding path program 1 times [2024-10-11 16:33:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:33:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975929756] [2024-10-11 16:33:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:33:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:33:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:33:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:33:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:33:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:33:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:33:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:33:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:33:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975929756] [2024-10-11 16:33:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975929756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:33:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:33:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:33:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079756952] [2024-10-11 16:33:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:33:59,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:33:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:33:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:33:59,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:33:59,878 INFO L87 Difference]: Start difference. First operand 1882 states and 2726 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:34:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:01,069 INFO L93 Difference]: Finished difference Result 4067 states and 5941 transitions. [2024-10-11 16:34:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 241 [2024-10-11 16:34:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:01,079 INFO L225 Difference]: With dead ends: 4067 [2024-10-11 16:34:01,080 INFO L226 Difference]: Without dead ends: 2422 [2024-10-11 16:34:01,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:34:01,083 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 5658 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5669 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:01,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5669 Valid, 3998 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 16:34:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-10-11 16:34:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1453. [2024-10-11 16:34:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4301675977653632) internal successors, (2048), 1437 states have internal predecessors, (2048), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2081 transitions. [2024-10-11 16:34:01,132 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2081 transitions. Word has length 241 [2024-10-11 16:34:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:01,133 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2081 transitions. [2024-10-11 16:34:01,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:34:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2081 transitions. [2024-10-11 16:34:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:34:01,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:01,136 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:34:01,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -997020238, now seen corresponding path program 1 times [2024-10-11 16:34:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584109419] [2024-10-11 16:34:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:34:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:01,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584109419] [2024-10-11 16:34:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584109419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031957746] [2024-10-11 16:34:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:01,578 INFO L87 Difference]: Start difference. First operand 1453 states and 2081 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:02,082 INFO L93 Difference]: Finished difference Result 2329 states and 3389 transitions. [2024-10-11 16:34:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:02,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:34:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:02,089 INFO L225 Difference]: With dead ends: 2329 [2024-10-11 16:34:02,089 INFO L226 Difference]: Without dead ends: 1413 [2024-10-11 16:34:02,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:02,091 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 51 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4695 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:02,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4695 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:34:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-11 16:34:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-11 16:34:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1390 states have (on average 1.4179856115107914) internal successors, (1971), 1395 states have internal predecessors, (1971), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2004 transitions. [2024-10-11 16:34:02,124 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2004 transitions. Word has length 251 [2024-10-11 16:34:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:02,125 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2004 transitions. [2024-10-11 16:34:02,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2004 transitions. [2024-10-11 16:34:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:34:02,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:02,128 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:34:02,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1775352732, now seen corresponding path program 1 times [2024-10-11 16:34:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834305344] [2024-10-11 16:34:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:34:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834305344] [2024-10-11 16:34:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834305344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:34:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749508424] [2024-10-11 16:34:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:34:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:02,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:34:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:02,568 INFO L87 Difference]: Start difference. First operand 1411 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:03,080 INFO L93 Difference]: Finished difference Result 2262 states and 3272 transitions. [2024-10-11 16:34:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:34:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:34:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:03,087 INFO L225 Difference]: With dead ends: 2262 [2024-10-11 16:34:03,087 INFO L226 Difference]: Without dead ends: 1413 [2024-10-11 16:34:03,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:03,090 INFO L432 NwaCegarLoop]: 1225 mSDtfsCounter, 22 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:03,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3524 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:34:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-11 16:34:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-11 16:34:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1390 states have (on average 1.4158273381294963) internal successors, (1968), 1395 states have internal predecessors, (1968), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2001 transitions. [2024-10-11 16:34:03,133 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2001 transitions. Word has length 251 [2024-10-11 16:34:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2001 transitions. [2024-10-11 16:34:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2001 transitions. [2024-10-11 16:34:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:34:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:03,137 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:34:03,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1061532776, now seen corresponding path program 1 times [2024-10-11 16:34:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975100863] [2024-10-11 16:34:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975100863] [2024-10-11 16:34:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975100863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683310751] [2024-10-11 16:34:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:04,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:04,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:34:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:04,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 16:34:04,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:05,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:05,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:34:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683310751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:34:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-11 16:34:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942091434] [2024-10-11 16:34:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:34:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:34:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:34:05,463 INFO L87 Difference]: Start difference. First operand 1411 states and 2001 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:07,082 INFO L93 Difference]: Finished difference Result 2612 states and 3719 transitions. [2024-10-11 16:34:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:34:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:34:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:07,089 INFO L225 Difference]: With dead ends: 2612 [2024-10-11 16:34:07,089 INFO L226 Difference]: Without dead ends: 1734 [2024-10-11 16:34:07,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:34:07,091 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 1269 mSDsluCounter, 3939 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:07,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 5133 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 16:34:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-10-11 16:34:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1580. [2024-10-11 16:34:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1549 states have (on average 1.4067140090380892) internal successors, (2179), 1558 states have internal predecessors, (2179), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 16:34:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2226 transitions. [2024-10-11 16:34:07,137 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2226 transitions. Word has length 251 [2024-10-11 16:34:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:07,138 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2226 transitions. [2024-10-11 16:34:07,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2226 transitions. [2024-10-11 16:34:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-11 16:34:07,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:07,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:07,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:34:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 16:34:07,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:07,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1167541261, now seen corresponding path program 1 times [2024-10-11 16:34:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738027058] [2024-10-11 16:34:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 74 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738027058] [2024-10-11 16:34:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738027058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889799693] [2024-10-11 16:34:09,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:09,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:09,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:09,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:34:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:09,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 16:34:09,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:09,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:34:10,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:10,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 74 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:10,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 74 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889799693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:10,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:10,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2024-10-11 16:34:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543987704] [2024-10-11 16:34:10,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 16:34:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:10,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 16:34:10,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:34:10,530 INFO L87 Difference]: Start difference. First operand 1580 states and 2226 transitions. Second operand has 13 states, 13 states have (on average 37.23076923076923) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 16:34:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:11,499 INFO L93 Difference]: Finished difference Result 3873 states and 5428 transitions. [2024-10-11 16:34:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 16:34:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 37.23076923076923) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 328 [2024-10-11 16:34:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:11,509 INFO L225 Difference]: With dead ends: 3873 [2024-10-11 16:34:11,509 INFO L226 Difference]: Without dead ends: 2530 [2024-10-11 16:34:11,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 653 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-11 16:34:11,513 INFO L432 NwaCegarLoop]: 1199 mSDtfsCounter, 2134 mSDsluCounter, 7803 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 9002 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:11,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 9002 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:34:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2024-10-11 16:34:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2236. [2024-10-11 16:34:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2193 states have (on average 1.3812129502963977) internal successors, (3029), 2202 states have internal predecessors, (3029), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 16:34:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3098 transitions. [2024-10-11 16:34:11,584 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3098 transitions. Word has length 328 [2024-10-11 16:34:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 3098 transitions. [2024-10-11 16:34:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.23076923076923) internal successors, (484), 12 states have internal predecessors, (484), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 16:34:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3098 transitions. [2024-10-11 16:34:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2024-10-11 16:34:11,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:11,601 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:11,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 16:34:11,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:11,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1402568228, now seen corresponding path program 1 times [2024-10-11 16:34:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:11,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040019198] [2024-10-11 16:34:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 296 proven. 896 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040019198] [2024-10-11 16:34:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040019198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266079348] [2024-10-11 16:34:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:18,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:18,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:18,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:34:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:20,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 16:34:20,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:20,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:34:20,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:20,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:21,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:21,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:21,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 296 proven. 896 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:21,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 296 proven. 896 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266079348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:22,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 22 [2024-10-11 16:34:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948143348] [2024-10-11 16:34:22,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 16:34:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 16:34:22,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:34:22,257 INFO L87 Difference]: Start difference. First operand 2236 states and 3098 transitions. Second operand has 22 states, 22 states have (on average 62.63636363636363) internal successors, (1378), 21 states have internal predecessors, (1378), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 16:34:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:23,478 INFO L93 Difference]: Finished difference Result 5631 states and 7801 transitions. [2024-10-11 16:34:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 16:34:23,480 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 62.63636363636363) internal successors, (1378), 21 states have internal predecessors, (1378), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 772 [2024-10-11 16:34:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:23,504 INFO L225 Difference]: With dead ends: 5631 [2024-10-11 16:34:23,505 INFO L226 Difference]: Without dead ends: 4288 [2024-10-11 16:34:23,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1577 GetRequests, 1539 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 16:34:23,509 INFO L432 NwaCegarLoop]: 1199 mSDtfsCounter, 6330 mSDsluCounter, 10054 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6416 SdHoareTripleChecker+Valid, 11253 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:23,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6416 Valid, 11253 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:34:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2024-10-11 16:34:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3994. [2024-10-11 16:34:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3927 states have (on average 1.35650623885918) internal successors, (5327), 3936 states have internal predecessors, (5327), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 16:34:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5444 transitions. [2024-10-11 16:34:23,630 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5444 transitions. Word has length 772 [2024-10-11 16:34:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:23,631 INFO L471 AbstractCegarLoop]: Abstraction has 3994 states and 5444 transitions. [2024-10-11 16:34:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.63636363636363) internal successors, (1378), 21 states have internal predecessors, (1378), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 16:34:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5444 transitions. [2024-10-11 16:34:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1661 [2024-10-11 16:34:23,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:23,718 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:23,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 16:34:23,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:23,919 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1259807738, now seen corresponding path program 2 times [2024-10-11 16:34:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472984447] [2024-10-11 16:34:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 2015 proven. 76 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2024-10-11 16:34:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472984447] [2024-10-11 16:34:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472984447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760101640] [2024-10-11 16:34:30,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:34:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:30,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:30,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:34:32,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:34:32,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:34:32,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:34:32,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:32,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:34:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7432 trivial. 0 not checked. [2024-10-11 16:34:33,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:34:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760101640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:34:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2024-10-11 16:34:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530226414] [2024-10-11 16:34:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:34:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:33,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:34:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-10-11 16:34:33,109 INFO L87 Difference]: Start difference. First operand 3994 states and 5444 transitions. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:34,160 INFO L93 Difference]: Finished difference Result 4854 states and 6721 transitions. [2024-10-11 16:34:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:34:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1660 [2024-10-11 16:34:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:34,185 INFO L225 Difference]: With dead ends: 4854 [2024-10-11 16:34:34,185 INFO L226 Difference]: Without dead ends: 4000 [2024-10-11 16:34:34,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1685 GetRequests, 1662 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2024-10-11 16:34:34,194 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 395 mSDsluCounter, 7597 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 8827 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:34,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 8827 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:34:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2024-10-11 16:34:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3997. [2024-10-11 16:34:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3930 states have (on average 1.356234096692112) internal successors, (5330), 3939 states have internal predecessors, (5330), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 16:34:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5447 transitions. [2024-10-11 16:34:34,431 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5447 transitions. Word has length 1660 [2024-10-11 16:34:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:34,436 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 5447 transitions. [2024-10-11 16:34:34,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5447 transitions. [2024-10-11 16:34:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1661 [2024-10-11 16:34:34,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:34,476 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:34,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:34:34,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 16:34:34,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:34,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 837281266, now seen corresponding path program 1 times [2024-10-11 16:34:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927720219] [2024-10-11 16:34:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7432 trivial. 0 not checked. [2024-10-11 16:34:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927720219] [2024-10-11 16:34:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927720219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:37,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313630587] [2024-10-11 16:34:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:37,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:37,691 INFO L87 Difference]: Start difference. First operand 3997 states and 5447 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 4 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:38,315 INFO L93 Difference]: Finished difference Result 4860 states and 6771 transitions. [2024-10-11 16:34:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:38,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 4 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1660 [2024-10-11 16:34:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:38,329 INFO L225 Difference]: With dead ends: 4860 [2024-10-11 16:34:38,329 INFO L226 Difference]: Without dead ends: 3994 [2024-10-11 16:34:38,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:38,333 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 30 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:38,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4690 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:34:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-11 16:34:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3988. [2024-10-11 16:34:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3921 states have (on average 1.3565416985462893) internal successors, (5319), 3930 states have internal predecessors, (5319), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 16:34:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5436 transitions. [2024-10-11 16:34:38,454 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5436 transitions. Word has length 1660 [2024-10-11 16:34:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5436 transitions. [2024-10-11 16:34:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 4 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:34:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5436 transitions. [2024-10-11 16:34:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1662 [2024-10-11 16:34:38,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:38,478 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:34:38,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 118155250, now seen corresponding path program 1 times [2024-10-11 16:34:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517788709] [2024-10-11 16:34:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:45,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:34:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:34:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:34:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:34:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 2015 proven. 76 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2024-10-11 16:34:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517788709] [2024-10-11 16:34:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517788709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642563412] [2024-10-11 16:34:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:45,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:45,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:34:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:48,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 8007 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 16:34:48,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:48,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:48,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:48,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:49,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:50,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:50,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-11 16:34:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 16:34:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 42 proven. 7372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:50,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 42 proven. 7372 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642563412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:52,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 35 [2024-10-11 16:34:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384479862] [2024-10-11 16:34:52,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 16:34:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:52,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 16:34:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=801, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 16:34:52,178 INFO L87 Difference]: Start difference. First operand 3988 states and 5436 transitions. Second operand has 35 states, 35 states have (on average 96.8) internal successors, (3388), 34 states have internal predecessors, (3388), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)