./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 32caf91a957359107cc7ee97dff15a48767c1a44f043f2c3cd059b67296b8bad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:20:26,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:20:26,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 07:20:26,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:20:26,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:20:26,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:20:26,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:20:26,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:20:26,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:20:26,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:20:26,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:20:26,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:20:26,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:20:26,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:20:26,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:20:26,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:20:26,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:20:26,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:20:26,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:20:26,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:20:26,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:20:26,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:20:26,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:20:26,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:20:26,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:20:26,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:20:26,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:20:26,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:20:26,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:20:26,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:20:26,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:20:26,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:20:26,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:20:26,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:20:26,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:20:26,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:20:26,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:20:26,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:20:26,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:20:26,637 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/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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32caf91a957359107cc7ee97dff15a48767c1a44f043f2c3cd059b67296b8bad [2024-10-13 07:20:26,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:20:26,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:20:26,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:20:26,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:20:26,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:20:26,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i [2024-10-13 07:20:28,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:20:28,852 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:20:28,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i [2024-10-13 07:20:28,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b49c431/c9a4efb6b7604e6a95ebe4b3fb2d876d/FLAG2dd74f79b [2024-10-13 07:20:28,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b49c431/c9a4efb6b7604e6a95ebe4b3fb2d876d [2024-10-13 07:20:28,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:20:28,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:20:28,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:20:28,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:20:28,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:20:28,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:20:28" (1/1) ... [2024-10-13 07:20:28,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0bc7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:28, skipping insertion in model container [2024-10-13 07:20:28,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:20:28" (1/1) ... [2024-10-13 07:20:29,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:20:29,260 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/aws-c-common/aws_array_list_init_dynamic_harness.i[4501,4514] [2024-10-13 07:20:29,267 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/aws-c-common/aws_array_list_init_dynamic_harness.i[4561,4574] [2024-10-13 07:20:29,911 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,912 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,913 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,913 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,914 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,927 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,928 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,929 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,931 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,934 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,935 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,937 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:29,938 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,458 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,465 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:20:30,555 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:20:30,569 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/aws-c-common/aws_array_list_init_dynamic_harness.i[4501,4514] [2024-10-13 07:20:30,572 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/aws-c-common/aws_array_list_init_dynamic_harness.i[4561,4574] [2024-10-13 07:20:30,625 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,626 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,626 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,626 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,627 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,673 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,675 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,676 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,677 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,678 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,678 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,679 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,679 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,768 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,773 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:30,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7529-7540] [2024-10-13 07:20:30,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:20:31,014 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:20:31,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31 WrapperNode [2024-10-13 07:20:31,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:20:31,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:20:31,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:20:31,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:20:31,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,205 INFO L138 Inliner]: procedures = 679, calls = 1552, calls flagged for inlining = 47, calls inlined = 6, statements flattened = 595 [2024-10-13 07:20:31,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:20:31,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:20:31,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:20:31,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:20:31,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,310 INFO L175 MemorySlicer]: Split 275 memory accesses to 5 slices as follows [2, 236, 26, 6, 5]. 86 percent of accesses are in the largest equivalence class. The 249 initializations are split as follows [2, 236, 5, 1, 5]. The 6 writes are split as follows [0, 0, 5, 1, 0]. [2024-10-13 07:20:31,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:20:31,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:20:31,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:20:31,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:20:31,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (1/1) ... [2024-10-13 07:20:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:20:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:31,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 07:20:31,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 07:20:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-10-13 07:20:31,468 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-10-13 07:20:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:20:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-13 07:20:31,469 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-13 07:20:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-13 07:20:31,469 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-13 07:20:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-10-13 07:20:31,469 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-10-13 07:20:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:20:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:20:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 07:20:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 07:20:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 07:20:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-13 07:20:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-13 07:20:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 07:20:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 07:20:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 07:20:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:20:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:20:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-13 07:20:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-13 07:20:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-13 07:20:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-13 07:20:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-13 07:20:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-13 07:20:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-10-13 07:20:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-10-13 07:20:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 07:20:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 07:20:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 07:20:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-13 07:20:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-13 07:20:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 07:20:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 07:20:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 07:20:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-13 07:20:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-13 07:20:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 07:20:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 07:20:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-10-13 07:20:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-10-13 07:20:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:20:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 07:20:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-13 07:20:31,476 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-13 07:20:31,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 07:20:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 07:20:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:20:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:20:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:20:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 07:20:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 07:20:31,793 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:20:31,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:20:32,609 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-13 07:20:32,610 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:20:32,710 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:20:32,710 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 07:20:32,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:20:32 BoogieIcfgContainer [2024-10-13 07:20:32,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:20:32,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:20:32,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:20:32,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:20:32,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:20:28" (1/3) ... [2024-10-13 07:20:32,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1b95e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:20:32, skipping insertion in model container [2024-10-13 07:20:32,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:31" (2/3) ... [2024-10-13 07:20:32,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1b95e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:20:32, skipping insertion in model container [2024-10-13 07:20:32,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:20:32" (3/3) ... [2024-10-13 07:20:32,722 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_init_dynamic_harness.i [2024-10-13 07:20:32,739 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:20:32,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 07:20:32,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:20:32,816 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;@7e3461f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:20:32,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 07:20:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 07:20:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 07:20:32,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:32,830 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-13 07:20:32,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1266245764, now seen corresponding path program 1 times [2024-10-13 07:20:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560826572] [2024-10-13 07:20:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:32,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:33,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560826572] [2024-10-13 07:20:33,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560826572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:33,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 07:20:33,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504383238] [2024-10-13 07:20:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:33,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 07:20:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 07:20:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:20:33,681 INFO L87 Difference]: Start difference. First operand has 127 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 07:20:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:34,153 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2024-10-13 07:20:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 07:20:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 58 [2024-10-13 07:20:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:34,166 INFO L225 Difference]: With dead ends: 256 [2024-10-13 07:20:34,166 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 07:20:34,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 07:20:34,172 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:34,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 07:20:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 07:20:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2024-10-13 07:20:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 73 states have internal predecessors, (87), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 07:20:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 157 transitions. [2024-10-13 07:20:34,231 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 157 transitions. Word has length 58 [2024-10-13 07:20:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:34,231 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 157 transitions. [2024-10-13 07:20:34,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 07:20:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2024-10-13 07:20:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 07:20:34,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:34,236 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-13 07:20:34,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:20:34,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:34,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash -979280306, now seen corresponding path program 1 times [2024-10-13 07:20:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:34,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228937190] [2024-10-13 07:20:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 07:20:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228937190] [2024-10-13 07:20:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228937190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:35,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:35,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 07:20:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330917632] [2024-10-13 07:20:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 07:20:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:35,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 07:20:35,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:20:35,148 INFO L87 Difference]: Start difference. First operand 123 states and 157 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 07:20:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:36,173 INFO L93 Difference]: Finished difference Result 145 states and 183 transitions. [2024-10-13 07:20:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:20:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 63 [2024-10-13 07:20:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:36,176 INFO L225 Difference]: With dead ends: 145 [2024-10-13 07:20:36,176 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 07:20:36,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:20:36,178 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 120 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:36,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 281 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:20:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 07:20:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-10-13 07:20:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 77 states have internal predecessors, (90), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 07:20:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2024-10-13 07:20:36,203 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 63 [2024-10-13 07:20:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2024-10-13 07:20:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 07:20:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2024-10-13 07:20:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 07:20:36,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:36,206 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-13 07:20:36,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:20:36,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash -977433264, now seen corresponding path program 1 times [2024-10-13 07:20:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374164058] [2024-10-13 07:20:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 07:20:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374164058] [2024-10-13 07:20:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374164058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 07:20:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397947036] [2024-10-13 07:20:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:36,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 07:20:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 07:20:36,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:20:36,818 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 07:20:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:37,788 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2024-10-13 07:20:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 07:20:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 63 [2024-10-13 07:20:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:37,791 INFO L225 Difference]: With dead ends: 251 [2024-10-13 07:20:37,791 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 07:20:37,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:20:37,793 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 111 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:37,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:20:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 07:20:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2024-10-13 07:20:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 78 states have internal predecessors, (91), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 07:20:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2024-10-13 07:20:37,810 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 63 [2024-10-13 07:20:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:37,811 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2024-10-13 07:20:37,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 07:20:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2024-10-13 07:20:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 07:20:37,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:37,812 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-13 07:20:37,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:20:37,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 620440132, now seen corresponding path program 1 times [2024-10-13 07:20:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999700673] [2024-10-13 07:20:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999700673] [2024-10-13 07:20:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999700673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:20:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655764440] [2024-10-13 07:20:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:38,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:38,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:20:38,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 07:20:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:38,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 07:20:38,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:20:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:39,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:20:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655764440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:20:39,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:20:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-10-13 07:20:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229495555] [2024-10-13 07:20:39,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:20:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 07:20:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 07:20:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-13 07:20:39,201 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 07:20:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:40,679 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2024-10-13 07:20:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 07:20:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 64 [2024-10-13 07:20:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:40,682 INFO L225 Difference]: With dead ends: 255 [2024-10-13 07:20:40,682 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 07:20:40,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-10-13 07:20:40,687 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 160 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:40,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 426 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 07:20:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 07:20:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2024-10-13 07:20:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 78 states have (on average 1.205128205128205) internal successors, (94), 81 states have internal predecessors, (94), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 07:20:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2024-10-13 07:20:40,723 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 64 [2024-10-13 07:20:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:40,724 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2024-10-13 07:20:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 07:20:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2024-10-13 07:20:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 07:20:40,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:40,729 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-13 07:20:40,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 07:20:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:40,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1991715408, now seen corresponding path program 2 times [2024-10-13 07:20:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603252118] [2024-10-13 07:20:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 07:20:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603252118] [2024-10-13 07:20:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603252118] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:20:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632220851] [2024-10-13 07:20:41,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 07:20:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:41,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:20:41,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 07:20:42,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 07:20:42,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:20:42,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 07:20:42,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:20:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:42,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:20:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632220851] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:20:42,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:20:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-10-13 07:20:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883408788] [2024-10-13 07:20:42,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:20:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 07:20:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 07:20:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-13 07:20:42,929 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 07:20:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:45,286 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2024-10-13 07:20:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 07:20:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 67 [2024-10-13 07:20:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:45,289 INFO L225 Difference]: With dead ends: 261 [2024-10-13 07:20:45,289 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 07:20:45,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 07:20:45,294 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:45,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 859 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 07:20:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 07:20:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2024-10-13 07:20:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 87 states have internal predecessors, (100), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 07:20:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2024-10-13 07:20:45,316 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 67 [2024-10-13 07:20:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:45,317 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2024-10-13 07:20:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 07:20:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2024-10-13 07:20:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 07:20:45,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:45,318 INFO L215 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 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] [2024-10-13 07:20:45,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 07:20:45,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:45,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:45,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1962449456, now seen corresponding path program 3 times [2024-10-13 07:20:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711838135] [2024-10-13 07:20:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 07:20:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711838135] [2024-10-13 07:20:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711838135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:20:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189215522] [2024-10-13 07:20:46,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 07:20:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:46,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:20:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 07:20:51,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 07:20:51,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:20:51,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 2180 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 07:20:51,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:20:51,355 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 13 treesize of output 9 [2024-10-13 07:20:51,420 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-13 07:20:51,421 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 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-13 07:20:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:51,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:20:52,271 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 21 treesize of output 19 [2024-10-13 07:20:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 23 [2024-10-13 07:20:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:20:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189215522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:20:52,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:20:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 35 [2024-10-13 07:20:52,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505947303] [2024-10-13 07:20:52,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:20:52,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 07:20:52,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 07:20:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 07:20:52,636 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 35 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-13 07:20:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:57,498 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2024-10-13 07:20:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 07:20:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 73 [2024-10-13 07:20:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:57,500 INFO L225 Difference]: With dead ends: 330 [2024-10-13 07:20:57,500 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 07:20:57,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=248, Invalid=2722, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 07:20:57,503 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 293 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 221 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 3534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:57,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 891 Invalid, 3534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 3304 Invalid, 9 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 07:20:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 07:20:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 197. [2024-10-13 07:20:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 127 states have internal predecessors, (147), 50 states have call successors, (50), 24 states have call predecessors, (50), 24 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 07:20:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 243 transitions. [2024-10-13 07:20:57,530 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 243 transitions. Word has length 73 [2024-10-13 07:20:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:57,530 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 243 transitions. [2024-10-13 07:20:57,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-13 07:20:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 243 transitions. [2024-10-13 07:20:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 07:20:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:57,531 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-13 07:20:57,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 07:20:57,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:57,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1605395570, now seen corresponding path program 1 times [2024-10-13 07:20:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042632927] [2024-10-13 07:20:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:20:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 07:20:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-13 07:20:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042632927] [2024-10-13 07:20:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042632927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 07:20:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900933104] [2024-10-13 07:20:58,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:58,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 07:20:58,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 07:20:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:20:58,159 INFO L87 Difference]: Start difference. First operand 197 states and 243 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 07:20:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:58,917 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2024-10-13 07:20:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:20:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-13 07:20:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:58,919 INFO L225 Difference]: With dead ends: 269 [2024-10-13 07:20:58,919 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 07:20:58,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:20:58,920 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 110 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:58,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 281 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:20:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 07:20:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 201. [2024-10-13 07:20:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 125 states have (on average 1.2) internal successors, (150), 130 states have internal predecessors, (150), 50 states have call successors, (50), 24 states have call predecessors, (50), 25 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2024-10-13 07:20:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 248 transitions. [2024-10-13 07:20:58,953 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 248 transitions. Word has length 77 [2024-10-13 07:20:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:58,954 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 248 transitions. [2024-10-13 07:20:58,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 07:20:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 248 transitions. [2024-10-13 07:20:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 07:20:58,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:58,956 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-13 07:20:58,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:20:58,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2139367384, now seen corresponding path program 1 times [2024-10-13 07:20:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:58,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976550262] [2024-10-13 07:20:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:20:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:20:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:20:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:20:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:20:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:20:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 07:20:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-13 07:20:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976550262] [2024-10-13 07:20:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976550262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 07:20:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520688291] [2024-10-13 07:20:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:59,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 07:20:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 07:20:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 07:20:59,720 INFO L87 Difference]: Start difference. First operand 201 states and 248 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 07:21:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:21:00,847 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2024-10-13 07:21:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 07:21:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 81 [2024-10-13 07:21:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:21:00,849 INFO L225 Difference]: With dead ends: 257 [2024-10-13 07:21:00,850 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 07:21:00,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-13 07:21:00,850 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:21:00,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 343 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 07:21:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 07:21:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 215. [2024-10-13 07:21:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 133 states have (on average 1.1879699248120301) internal successors, (158), 140 states have internal predecessors, (158), 52 states have call successors, (52), 26 states have call predecessors, (52), 29 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2024-10-13 07:21:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2024-10-13 07:21:00,878 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 81 [2024-10-13 07:21:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:21:00,879 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2024-10-13 07:21:00,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 07:21:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2024-10-13 07:21:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 07:21:00,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:21:00,880 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-13 07:21:00,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 07:21:00,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:21:00,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:21:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash -587537713, now seen corresponding path program 1 times [2024-10-13 07:21:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:21:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203622710] [2024-10-13 07:21:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:21:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:21:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:21:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:21:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:21:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:21:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:21:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:21:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:21:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:21:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 07:21:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:21:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:21:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203622710] [2024-10-13 07:21:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203622710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:21:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280093904] [2024-10-13 07:21:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:21:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:21:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:21:02,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:21:02,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 07:21:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:02,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-13 07:21:02,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:21:02,907 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-13 07:21:02,957 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 21 treesize of output 20 [2024-10-13 07:21:03,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 07:21:03,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 07:21:03,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2024-10-13 07:21:03,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-10-13 07:21:03,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2024-10-13 07:21:03,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2024-10-13 07:21:03,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2024-10-13 07:21:03,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2024-10-13 07:21:03,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:03,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2024-10-13 07:21:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:21:03,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:21:08,096 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 14 treesize of output 12 [2024-10-13 07:21:08,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 14 [2024-10-13 07:21:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:21:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280093904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:21:08,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:21:08,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 54 [2024-10-13 07:21:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444678664] [2024-10-13 07:21:08,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:21:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-13 07:21:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:21:08,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-13 07:21:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2397, Unknown=0, NotChecked=0, Total=2862 [2024-10-13 07:21:08,181 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand has 54 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 5 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-13 07:21:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:21:13,706 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2024-10-13 07:21:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 07:21:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 5 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 81 [2024-10-13 07:21:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:21:13,709 INFO L225 Difference]: With dead ends: 444 [2024-10-13 07:21:13,709 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 07:21:13,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=892, Invalid=5428, Unknown=0, NotChecked=0, Total=6320 [2024-10-13 07:21:13,712 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 271 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:21:13,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1123 Invalid, 3974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 07:21:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 07:21:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 224. [2024-10-13 07:21:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 140 states have (on average 1.207142857142857) internal successors, (169), 149 states have internal predecessors, (169), 52 states have call successors, (52), 26 states have call predecessors, (52), 31 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2024-10-13 07:21:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 277 transitions. [2024-10-13 07:21:13,742 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 277 transitions. Word has length 81 [2024-10-13 07:21:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:21:13,743 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 277 transitions. [2024-10-13 07:21:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 5 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-13 07:21:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 277 transitions. [2024-10-13 07:21:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 07:21:13,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:21:13,744 INFO L215 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 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] [2024-10-13 07:21:13,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 07:21:13,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:21:13,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:21:13,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:21:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash 577977225, now seen corresponding path program 1 times [2024-10-13 07:21:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:21:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753908698] [2024-10-13 07:21:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:21:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:21:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:21:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:21:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:21:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:21:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:21:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:21:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:21:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:21:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 07:21:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 07:21:15,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:21:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753908698] [2024-10-13 07:21:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753908698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:21:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551565583] [2024-10-13 07:21:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:21:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:21:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:21:15,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:21:15,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 07:21:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:15,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-13 07:21:15,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:21:15,922 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-13 07:21:15,949 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 21 treesize of output 20 [2024-10-13 07:21:15,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:15,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 07:21:16,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 07:21:16,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2024-10-13 07:21:16,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-10-13 07:21:16,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2024-10-13 07:21:16,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2024-10-13 07:21:16,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2024-10-13 07:21:16,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2024-10-13 07:21:16,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2024-10-13 07:21:16,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:16,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2024-10-13 07:21:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 86 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:21:18,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:21:25,344 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 82 treesize of output 80 [2024-10-13 07:21:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 157 treesize of output 153 [2024-10-13 07:21:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-13 07:21:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551565583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:21:25,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:21:25,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 23] total 64 [2024-10-13 07:21:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286570788] [2024-10-13 07:21:25,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:21:25,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-13 07:21:25,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:21:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-13 07:21:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3652, Unknown=0, NotChecked=0, Total=4032 [2024-10-13 07:21:25,499 INFO L87 Difference]: Start difference. First operand 224 states and 277 transitions. Second operand has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-13 07:21:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:21:37,009 INFO L93 Difference]: Finished difference Result 531 states and 666 transitions. [2024-10-13 07:21:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 07:21:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 84 [2024-10-13 07:21:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:21:37,012 INFO L225 Difference]: With dead ends: 531 [2024-10-13 07:21:37,012 INFO L226 Difference]: Without dead ends: 343 [2024-10-13 07:21:37,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2059 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=957, Invalid=9549, Unknown=0, NotChecked=0, Total=10506 [2024-10-13 07:21:37,016 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 444 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 6797 mSolverCounterSat, 277 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 7078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 6797 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:21:37,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1332 Invalid, 7078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 6797 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2024-10-13 07:21:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-13 07:21:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 276. [2024-10-13 07:21:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 175 states have (on average 1.24) internal successors, (217), 186 states have internal predecessors, (217), 63 states have call successors, (63), 32 states have call predecessors, (63), 37 states have return successors, (65), 57 states have call predecessors, (65), 57 states have call successors, (65) [2024-10-13 07:21:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 345 transitions. [2024-10-13 07:21:37,065 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 345 transitions. Word has length 84 [2024-10-13 07:21:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:21:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 345 transitions. [2024-10-13 07:21:37,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-13 07:21:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 345 transitions. [2024-10-13 07:21:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 07:21:37,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:21:37,067 INFO L215 NwaCegarLoop]: trace histogram [13, 5, 5, 5, 3, 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] [2024-10-13 07:21:37,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 07:21:37,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 07:21:37,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:21:37,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:21:37,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1170588507, now seen corresponding path program 2 times [2024-10-13 07:21:37,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:21:37,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066123946] [2024-10-13 07:21:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:21:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:21:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:21:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:21:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 07:21:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:21:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:21:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:21:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 07:21:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 07:21:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:21:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 07:21:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:21:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:21:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-13 07:21:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:21:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066123946] [2024-10-13 07:21:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066123946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:21:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78123712] [2024-10-13 07:21:38,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 07:21:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:21:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:21:38,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 07:21:38,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 07:21:39,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 07:21:39,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 07:21:39,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-13 07:21:39,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:21:39,314 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 07:21:39,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 07:21:39,460 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-13 07:21:39,487 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 21 treesize of output 20 [2024-10-13 07:21:39,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 07:21:39,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 07:21:39,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2024-10-13 07:21:39,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-10-13 07:21:39,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2024-10-13 07:21:39,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2024-10-13 07:21:39,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2024-10-13 07:21:39,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2024-10-13 07:21:40,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:40,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2024-10-13 07:21:40,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:40,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2024-10-13 07:21:40,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 07:21:40,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 120 treesize of output 152 [2024-10-13 07:21:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 6 proven. 97 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 07:21:40,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:21:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78123712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:21:40,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 07:21:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2024-10-13 07:21:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193630436] [2024-10-13 07:21:40,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 07:21:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-13 07:21:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:21:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 07:21:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1709, Unknown=0, NotChecked=0, Total=1806 [2024-10-13 07:21:40,904 INFO L87 Difference]: Start difference. First operand 276 states and 345 transitions. Second operand has 39 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 4 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26)