./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_front_harness_negated.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_front_harness_negated.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 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:20:10,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:20:10,654 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:10,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:20:10,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:20:10,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:20:10,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:20:10,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:20:10,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:20:10,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:20:10,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:20:10,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:20:10,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:20:10,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:20:10,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:20:10,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:20:10,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:20:10,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:20:10,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:20:10,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:20:10,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:20:10,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:20:10,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:20:10,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:20:10,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:20:10,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:20:10,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:20:10,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:20:10,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:20:10,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:20:10,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:20:10,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:20:10,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:20:10,687 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 -> 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 [2024-10-13 07:20:10,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:20:10,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:20:10,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:20:10,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:20:10,895 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:20:10,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2024-10-13 07:20:12,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:20:12,452 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:20:12,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2024-10-13 07:20:12,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2089c51/795a518a80164f4a975daeeac2a6c207/FLAG60568c547 [2024-10-13 07:20:12,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2089c51/795a518a80164f4a975daeeac2a6c207 [2024-10-13 07:20:12,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:20:12,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:20:12,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:20:12,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:20:12,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:20:12,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:20:12" (1/1) ... [2024-10-13 07:20:12,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2980b67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:12, skipping insertion in model container [2024-10-13 07:20:12,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:20:12" (1/1) ... [2024-10-13 07:20:12,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:20:12,908 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_front_harness_negated.i[4494,4507] [2024-10-13 07:20:12,915 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_front_harness_negated.i[4554,4567] [2024-10-13 07:20:13,391 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,391 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,391 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,392 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,392 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,406 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,407 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,408 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,408 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,409 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,410 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,410 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,410 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,723 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,732 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:20:13,786 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:20:13,797 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_front_harness_negated.i[4494,4507] [2024-10-13 07:20:13,801 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_front_harness_negated.i[4554,4567] [2024-10-13 07:20:13,847 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,849 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,850 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,850 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,850 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,857 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,860 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,861 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,861 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,863 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,864 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,864 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,864 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:13,999 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:14,002 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-13 07:20:14,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] [2024-10-13 07:20:14,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:20:14,228 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:20:14,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:14 WrapperNode [2024-10-13 07:20:14,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:20:14,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:20:14,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:20:14,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:20:14,236 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:14" (1/1) ... [2024-10-13 07:20:14,293 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:14" (1/1) ... [2024-10-13 07:20:14,353 INFO L138 Inliner]: procedures = 680, calls = 1676, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 660 [2024-10-13 07:20:14,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:20:14,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:20:14,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:20:14,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:20:14,366 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:14" (1/1) ... [2024-10-13 07:20:14,366 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:14" (1/1) ... [2024-10-13 07:20:14,373 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:14" (1/1) ... [2024-10-13 07:20:14,440 INFO L175 MemorySlicer]: Split 312 memory accesses to 6 slices as follows [236, 2, 6, 56, 3, 9]. 76 percent of accesses are in the largest equivalence class. The 254 initializations are split as follows [236, 2, 0, 10, 1, 5]. The 7 writes are split as follows [0, 0, 2, 3, 1, 1]. [2024-10-13 07:20:14,443 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:14" (1/1) ... [2024-10-13 07:20:14,443 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:14" (1/1) ... [2024-10-13 07:20:14,476 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:14" (1/1) ... [2024-10-13 07:20:14,479 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:14" (1/1) ... [2024-10-13 07:20:14,484 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:14" (1/1) ... [2024-10-13 07:20:14,487 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:14" (1/1) ... [2024-10-13 07:20:14,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:20:14,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:20:14,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:20:14,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:20:14,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:14" (1/1) ... [2024-10-13 07:20:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:20:14,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:14,533 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:14,536 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:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:20:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-10-13 07:20:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-10-13 07:20:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-13 07:20:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-13 07:20:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-13 07:20:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-13 07:20:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 07:20:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-13 07:20:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 07:20:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:20:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 07:20:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 07:20:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 07:20:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-10-13 07:20:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-10-13 07:20:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:20:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:20:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-13 07:20:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-13 07:20:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-13 07:20:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-13 07:20:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-13 07:20:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-13 07:20:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-13 07:20:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-13 07:20:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-10-13 07:20:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-10-13 07:20:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2024-10-13 07:20:14,579 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2024-10-13 07:20:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 07:20:14,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 07:20:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-10-13 07:20:14,579 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-10-13 07:20:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:20:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 07:20:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 07:20:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 07:20:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 07:20:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 07:20:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-13 07:20:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-13 07:20:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-13 07:20:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-13 07:20:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:20:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:20:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:20:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 07:20:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 07:20:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 07:20:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-10-13 07:20:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-10-13 07:20:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:20:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:20:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:20:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 07:20:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 07:20:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 07:20:14,810 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:20:14,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:20:15,386 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-13 07:20:15,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:20:15,457 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:20:15,457 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 07:20:15,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:20:15 BoogieIcfgContainer [2024-10-13 07:20:15,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:20:15,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:20:15,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:20:15,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:20:15,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:20:12" (1/3) ... [2024-10-13 07:20:15,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b74609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:20:15, skipping insertion in model container [2024-10-13 07:20:15,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:20:14" (2/3) ... [2024-10-13 07:20:15,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b74609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:20:15, skipping insertion in model container [2024-10-13 07:20:15,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:20:15" (3/3) ... [2024-10-13 07:20:15,465 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_front_harness_negated.i [2024-10-13 07:20:15,477 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:20:15,477 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 07:20:15,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:20:15,542 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;@3c17866b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:20:15,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 07:20:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 07:20:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 07:20:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:15,560 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash -583617916, now seen corresponding path program 1 times [2024-10-13 07:20:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182597145] [2024-10-13 07:20:15,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:20:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 07:20:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 07:20:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 07:20:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 07:20:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182597145] [2024-10-13 07:20:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182597145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:16,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:20:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077128947] [2024-10-13 07:20:16,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:20:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:20:16,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:20:16,325 INFO L87 Difference]: Start difference. First operand has 170 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 07:20:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:17,151 INFO L93 Difference]: Finished difference Result 352 states and 523 transitions. [2024-10-13 07:20:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 07:20:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 123 [2024-10-13 07:20:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:17,162 INFO L225 Difference]: With dead ends: 352 [2024-10-13 07:20:17,162 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 07:20:17,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:20:17,170 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 96 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:17,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 288 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:20:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 07:20:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2024-10-13 07:20:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 92 states have internal predecessors, (108), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 07:20:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2024-10-13 07:20:17,232 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 123 [2024-10-13 07:20:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:17,233 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2024-10-13 07:20:17,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 07:20:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2024-10-13 07:20:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 07:20:17,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:17,237 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:20:17,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1117143876, now seen corresponding path program 1 times [2024-10-13 07:20:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343781644] [2024-10-13 07:20:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:20:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 07:20:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 07:20:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 07:20:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 07:20:17,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:17,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343781644] [2024-10-13 07:20:17,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343781644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:17,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:17,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 07:20:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413673666] [2024-10-13 07:20:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:17,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 07:20:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 07:20:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 07:20:17,982 INFO L87 Difference]: Start difference. First operand 164 states and 218 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 07:20:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:19,120 INFO L93 Difference]: Finished difference Result 301 states and 411 transitions. [2024-10-13 07:20:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 07:20:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 123 [2024-10-13 07:20:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:19,123 INFO L225 Difference]: With dead ends: 301 [2024-10-13 07:20:19,123 INFO L226 Difference]: Without dead ends: 196 [2024-10-13 07:20:19,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-13 07:20:19,127 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 145 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:19,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 660 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 07:20:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-13 07:20:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2024-10-13 07:20:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 100 states have internal predecessors, (117), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-13 07:20:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2024-10-13 07:20:19,146 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 123 [2024-10-13 07:20:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2024-10-13 07:20:19,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 07:20:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2024-10-13 07:20:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 07:20:19,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:19,149 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:20:19,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1993162882, now seen corresponding path program 1 times [2024-10-13 07:20:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019092697] [2024-10-13 07:20:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:20:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 07:20:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 07:20:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 07:20:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 07:20:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019092697] [2024-10-13 07:20:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019092697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 07:20:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382218828] [2024-10-13 07:20:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:19,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 07:20:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 07:20:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 07:20:19,837 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 07:20:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:21,194 INFO L93 Difference]: Finished difference Result 316 states and 439 transitions. [2024-10-13 07:20:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 07:20:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 123 [2024-10-13 07:20:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:21,197 INFO L225 Difference]: With dead ends: 316 [2024-10-13 07:20:21,197 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 07:20:21,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-13 07:20:21,201 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:21,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 774 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 07:20:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 07:20:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 183. [2024-10-13 07:20:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 103 states have internal predecessors, (120), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (62), 62 states have call predecessors, (62), 61 states have call successors, (62) [2024-10-13 07:20:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 245 transitions. [2024-10-13 07:20:21,228 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 245 transitions. Word has length 123 [2024-10-13 07:20:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 245 transitions. [2024-10-13 07:20:21,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-13 07:20:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 245 transitions. [2024-10-13 07:20:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 07:20:21,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:21,231 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:20:21,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1598796096, now seen corresponding path program 1 times [2024-10-13 07:20:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875495176] [2024-10-13 07:20:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:20:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 07:20:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 07:20:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 07:20:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-13 07:20:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875495176] [2024-10-13 07:20:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875495176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:21,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:21,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 07:20:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486110569] [2024-10-13 07:20:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:21,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 07:20:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 07:20:21,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 07:20:21,869 INFO L87 Difference]: Start difference. First operand 183 states and 245 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 07:20:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:22,975 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-10-13 07:20:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 07:20:22,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 123 [2024-10-13 07:20:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:22,979 INFO L225 Difference]: With dead ends: 206 [2024-10-13 07:20:22,979 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 07:20:22,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-13 07:20:22,980 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:22,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 655 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 07:20:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 07:20:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 190. [2024-10-13 07:20:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 64 states have call successors, (64), 18 states have call predecessors, (64), 19 states have return successors, (73), 63 states have call predecessors, (73), 62 states have call successors, (73) [2024-10-13 07:20:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2024-10-13 07:20:22,994 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 123 [2024-10-13 07:20:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:22,995 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2024-10-13 07:20:22,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 07:20:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2024-10-13 07:20:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 07:20:22,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:22,996 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:20:22,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 07:20:22,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2095779195, now seen corresponding path program 1 times [2024-10-13 07:20:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993882840] [2024-10-13 07:20:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 07:20:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 07:20:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 07:20:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 07:20:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:20:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-10-13 07:20:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993882840] [2024-10-13 07:20:23,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993882840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:20:23,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540679383] [2024-10-13 07:20:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:23,812 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:23,813 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:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:24,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 07:20:24,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:20:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-13 07:20:24,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:20:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540679383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:24,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:20:24,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-10-13 07:20:24,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231975126] [2024-10-13 07:20:24,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:24,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 07:20:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:24,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 07:20:24,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-10-13 07:20:24,344 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-13 07:20:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:24,742 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2024-10-13 07:20:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:20:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 136 [2024-10-13 07:20:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:24,744 INFO L225 Difference]: With dead ends: 353 [2024-10-13 07:20:24,744 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 07:20:24,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-13 07:20:24,745 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:24,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1155 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 07:20:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 07:20:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-13 07:20:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 94 states have internal predecessors, (106), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-13 07:20:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2024-10-13 07:20:24,758 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 136 [2024-10-13 07:20:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:24,759 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2024-10-13 07:20:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-13 07:20:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2024-10-13 07:20:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 07:20:24,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:24,760 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:20:24,776 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:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:24,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:24,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2091003050, now seen corresponding path program 1 times [2024-10-13 07:20:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621305696] [2024-10-13 07:20:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 07:20:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:20:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 07:20:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 07:20:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 07:20:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-13 07:20:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621305696] [2024-10-13 07:20:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621305696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:25,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 07:20:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160664868] [2024-10-13 07:20:25,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:25,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 07:20:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 07:20:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 07:20:25,562 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 07:20:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:26,404 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2024-10-13 07:20:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:20:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 136 [2024-10-13 07:20:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:26,406 INFO L225 Difference]: With dead ends: 183 [2024-10-13 07:20:26,406 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 07:20:26,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 07:20:26,407 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 139 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:26,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 477 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:20:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 07:20:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2024-10-13 07:20:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 97 states have internal predecessors, (109), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-13 07:20:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 228 transitions. [2024-10-13 07:20:26,418 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 228 transitions. Word has length 136 [2024-10-13 07:20:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:26,418 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 228 transitions. [2024-10-13 07:20:26,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 07:20:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 228 transitions. [2024-10-13 07:20:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 07:20:26,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:26,420 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 07:20:26,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:26,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1472875254, now seen corresponding path program 1 times [2024-10-13 07:20:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743803593] [2024-10-13 07:20:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 07:20:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:20:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 07:20:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 07:20:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 07:20:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:20:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-13 07:20:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-13 07:20:26,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:26,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743803593] [2024-10-13 07:20:26,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743803593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:26,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 07:20:26,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497317386] [2024-10-13 07:20:26,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:26,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 07:20:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 07:20:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 07:20:26,791 INFO L87 Difference]: Start difference. First operand 174 states and 228 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 07:20:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:27,686 INFO L93 Difference]: Finished difference Result 218 states and 282 transitions. [2024-10-13 07:20:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 07:20:27,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 148 [2024-10-13 07:20:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:27,688 INFO L225 Difference]: With dead ends: 218 [2024-10-13 07:20:27,688 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 07:20:27,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:20:27,688 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 153 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:27,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 476 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:20:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 07:20:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2024-10-13 07:20:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 99 states have internal predecessors, (111), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-13 07:20:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2024-10-13 07:20:27,698 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 148 [2024-10-13 07:20:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:27,699 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2024-10-13 07:20:27,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 07:20:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2024-10-13 07:20:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 07:20:27,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:27,700 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:20:27,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1000583590, now seen corresponding path program 1 times [2024-10-13 07:20:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217133174] [2024-10-13 07:20:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 07:20:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:20:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 07:20:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 07:20:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 07:20:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 07:20:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-13 07:20:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 07:20:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-13 07:20:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217133174] [2024-10-13 07:20:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217133174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:20:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 07:20:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254556134] [2024-10-13 07:20:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 07:20:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 07:20:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 07:20:28,415 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 07:20:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:29,474 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2024-10-13 07:20:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 07:20:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 153 [2024-10-13 07:20:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:29,476 INFO L225 Difference]: With dead ends: 189 [2024-10-13 07:20:29,476 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 07:20:29,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-13 07:20:29,477 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:29,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 490 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 07:20:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 07:20:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-10-13 07:20:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 102 states have internal predecessors, (114), 60 states have call successors, (60), 18 states have call predecessors, (60), 18 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2024-10-13 07:20:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2024-10-13 07:20:29,488 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 153 [2024-10-13 07:20:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:29,490 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2024-10-13 07:20:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 07:20:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2024-10-13 07:20:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 07:20:29,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:20:29,492 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 07:20:29,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:20:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:20:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1864855197, now seen corresponding path program 1 times [2024-10-13 07:20:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:20:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238137139] [2024-10-13 07:20:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:20:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 07:20:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 07:20:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 07:20:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:20:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:20:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 07:20:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:20:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 07:20:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 07:20:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 07:20:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 07:20:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 07:20:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 07:20:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:20:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 07:20:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 07:20:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:20:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 07:20:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:20:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 07:20:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 07:20:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 07:20:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:20:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 07:20:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:20:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-10-13 07:20:30,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:20:30,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238137139] [2024-10-13 07:20:30,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238137139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:20:30,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685912249] [2024-10-13 07:20:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:20:30,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:20:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:20:30,151 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:30,152 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:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:20:30,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 2321 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 07:20:30,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:20:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-13 07:20:30,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:20:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685912249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:20:30,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:20:30,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-13 07:20:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485657296] [2024-10-13 07:20:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:20:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:20:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:20:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:20:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:20:30,546 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-13 07:20:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:20:30,709 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2024-10-13 07:20:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:20:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 157 [2024-10-13 07:20:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:20:30,710 INFO L225 Difference]: With dead ends: 194 [2024-10-13 07:20:30,710 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 07:20:30,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 07:20:30,711 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:20:30,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 07:20:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 07:20:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 07:20:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 07:20:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 07:20:30,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2024-10-13 07:20:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:20:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 07:20:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-13 07:20:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 07:20:30,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 07:20:30,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 07:20:30,733 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:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 07:20:30,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:20:30,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 07:20:31,096 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 07:20:31,109 WARN L155 FloydHoareUtils]: Requires clause for bounded_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-13 07:20:31,111 WARN L155 FloydHoareUtils]: Requires clause for ensure_array_list_has_allocated_data_member contained old-variable. Original clause: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_int#5| |old(#memory_int#5)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= |#memory_real#5| |old(#memory_real#5)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|)) Eliminated clause: true [2024-10-13 07:20:31,112 WARN L155 FloydHoareUtils]: Requires clause for aws_array_list_is_valid contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: true [2024-10-13 07:20:31,118 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 07:20:31,118 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 07:20:31,118 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#4 [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#4 [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2024-10-13 07:20:31,119 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~list!base [2024-10-13 07:20:31,120 WARN L155 FloydHoareUtils]: Requires clause for aws_raise_error contained old-variable. Original clause: (= ~tl_last_error~0 |old(~tl_last_error~0)|) Eliminated clause: true [2024-10-13 07:20:31,121 WARN L155 FloydHoareUtils]: Requires clause for __CPROVER_overflow_mult contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-13 07:20:31,122 WARN L155 FloydHoareUtils]: Requires clause for aws_mul_size_checked contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: true [2024-10-13 07:20:31,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:20:31 BoogieIcfgContainer [2024-10-13 07:20:31,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 07:20:31,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 07:20:31,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 07:20:31,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 07:20:31,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:20:15" (3/4) ... [2024-10-13 07:20:31,126 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_array_list_has_allocated_data_member [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_bounded [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_valid [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memcpy [2024-10-13 07:20:31,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert_byte_from_buffer_matches [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_size_t [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_impl [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_length [2024-10-13 07:20:31,130 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 07:20:31,144 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2024-10-13 07:20:31,148 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2024-10-13 07:20:31,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-10-13 07:20:31,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 07:20:31,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 07:20:31,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 07:20:31,151 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 07:20:31,152 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 07:20:31,468 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 07:20:31,469 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 07:20:31,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 07:20:31,469 INFO L158 Benchmark]: Toolchain (without parser) took 18807.77ms. Allocated memory was 161.5MB in the beginning and 553.6MB in the end (delta: 392.2MB). Free memory was 121.3MB in the beginning and 162.1MB in the end (delta: -40.8MB). Peak memory consumption was 349.8MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,469 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 07:20:31,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1567.21ms. Allocated memory was 161.5MB in the beginning and 253.8MB in the end (delta: 92.3MB). Free memory was 120.8MB in the beginning and 183.4MB in the end (delta: -62.6MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.64ms. Allocated memory is still 253.8MB. Free memory was 183.4MB in the beginning and 173.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,470 INFO L158 Benchmark]: Boogie Preprocessor took 144.41ms. Allocated memory is still 253.8MB. Free memory was 173.9MB in the beginning and 158.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,470 INFO L158 Benchmark]: RCFGBuilder took 958.81ms. Allocated memory is still 253.8MB. Free memory was 158.2MB in the beginning and 115.7MB in the end (delta: 42.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,471 INFO L158 Benchmark]: TraceAbstraction took 15664.60ms. Allocated memory was 253.8MB in the beginning and 553.6MB in the end (delta: 299.9MB). Free memory was 114.6MB in the beginning and 287.9MB in the end (delta: -173.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,471 INFO L158 Benchmark]: Witness Printer took 344.33ms. Allocated memory is still 553.6MB. Free memory was 287.9MB in the beginning and 162.1MB in the end (delta: 125.8MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2024-10-13 07:20:31,472 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1567.21ms. Allocated memory was 161.5MB in the beginning and 253.8MB in the end (delta: 92.3MB). Free memory was 120.8MB in the beginning and 183.4MB in the end (delta: -62.6MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.64ms. Allocated memory is still 253.8MB. Free memory was 183.4MB in the beginning and 173.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.41ms. Allocated memory is still 253.8MB. Free memory was 173.9MB in the beginning and 158.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 958.81ms. Allocated memory is still 253.8MB. Free memory was 158.2MB in the beginning and 115.7MB in the end (delta: 42.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15664.60ms. Allocated memory was 253.8MB in the beginning and 553.6MB in the end (delta: 299.9MB). Free memory was 114.6MB in the beginning and 287.9MB in the end (delta: -173.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * Witness Printer took 344.33ms. Allocated memory is still 553.6MB. Free memory was 287.9MB in the beginning and 162.1MB in the end (delta: 125.8MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7735]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~list!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 170 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 5151 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4045 mSDsCounter, 1295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5167 IncrementalHoareTripleChecker+Invalid, 6462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1295 mSolverCounterUnsat, 1106 mSDtfsCounter, 5167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=4, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1515 NumberOfCodeBlocks, 1515 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1504 ConstructedInterpolants, 0 QuantifiedInterpolants, 3459 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4658 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2767/2790 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7349]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 2795]: Procedure Contract for can_fail_malloc Derived contract for procedure can_fail_malloc. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 210]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 7355]: Procedure Contract for my_memcpy Derived contract for procedure my_memcpy. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7162]: Procedure Contract for assert_byte_from_buffer_matches Derived contract for procedure assert_byte_from_buffer_matches. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 263]: Procedure Contract for nondet_size_t Derived contract for procedure nondet_size_t. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7341]: Procedure Contract for memcpy_impl Derived contract for procedure memcpy_impl. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3487]: Procedure Contract for aws_array_list_length Derived contract for procedure aws_array_list_length. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 222]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-13 07:20:31,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE