./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9cdcebc161918b7eba8ddf37eb6929c1febb35920ec9e070875db56fc6754865 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:35:31,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:35:31,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-27 23:35:31,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:35:31,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:35:31,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:35:31,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:35:31,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:35:31,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:35:31,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:35:31,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:35:31,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:35:31,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:35:31,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:35:31,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:35:31,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:35:31,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:35:31,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:35:31,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:35:31,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:35:31,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:35:31,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:35:31,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:35:31,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:35:31,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:35:31,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:35:31,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:35:31,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:35:31,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:35:31,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:35:31,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:35:31,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:35:31,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:35:31,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:35:31,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:35:31,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:35:31,715 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9cdcebc161918b7eba8ddf37eb6929c1febb35920ec9e070875db56fc6754865 [2024-11-27 23:35:32,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:35:32,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:35:32,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:35:32,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:35:32,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:35:32,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2024-11-27 23:35:35,445 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/data/07d386b91/5933a9be5aee4dee84c29f49f9532300/FLAGf37d491ec [2024-11-27 23:35:36,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:35:36,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2024-11-27 23:35:36,108 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/data/07d386b91/5933a9be5aee4dee84c29f49f9532300/FLAGf37d491ec [2024-11-27 23:35:36,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/data/07d386b91/5933a9be5aee4dee84c29f49f9532300 [2024-11-27 23:35:36,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:35:36,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:35:36,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:35:36,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:35:36,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:35:36,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:35:36" (1/1) ... [2024-11-27 23:35:36,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edb03ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:36, skipping insertion in model container [2024-11-27 23:35:36,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:35:36" (1/1) ... [2024-11-27 23:35:36,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:35:37,618 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,623 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,626 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,628 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,629 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,630 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,631 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,632 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,634 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,640 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,642 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,650 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,651 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,660 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,663 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,676 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,689 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 23:35:37,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:35:37,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:35:37,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:35:38,166 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-27 23:35:38,175 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:35:38,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38 WrapperNode [2024-11-27 23:35:38,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:35:38,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:35:38,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:35:38,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:35:38,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,292 INFO L138 Inliner]: procedures = 613, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 813 [2024-11-27 23:35:38,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:35:38,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:35:38,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:35:38,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:35:38,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,371 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-27 23:35:38,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:35:38,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:35:38,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:35:38,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:35:38,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (1/1) ... [2024-11-27 23:35:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:35:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:38,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:35:38,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:35:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:35:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-27 23:35:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-27 23:35:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 23:35:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:35:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:35:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-27 23:35:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:35:38,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:35:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-27 23:35:38,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-27 23:35:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-27 23:35:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-27 23:35:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 23:35:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 23:35:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:35:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-27 23:35:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2024-11-27 23:35:38,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2024-11-27 23:35:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-27 23:35:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 23:35:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 23:35:39,103 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:35:39,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:35:40,596 INFO L? ?]: Removed 358 outVars from TransFormulas that were not future-live. [2024-11-27 23:35:40,596 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:35:40,658 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:35:40,658 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-27 23:35:40,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:35:40 BoogieIcfgContainer [2024-11-27 23:35:40,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:35:40,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:35:40,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:35:40,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:35:40,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:35:36" (1/3) ... [2024-11-27 23:35:40,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42853c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:35:40, skipping insertion in model container [2024-11-27 23:35:40,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:35:38" (2/3) ... [2024-11-27 23:35:40,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42853c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:35:40, skipping insertion in model container [2024-11-27 23:35:40,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:35:40" (3/3) ... [2024-11-27 23:35:40,678 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-2.i [2024-11-27 23:35:40,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:35:40,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG whoami-incomplete-2.i that has 4 procedures, 316 locations, 1 initial locations, 11 loop locations, and 125 error locations. [2024-11-27 23:35:40,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:35:40,785 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=None, 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;@6f1280c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:35:40,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2024-11-27 23:35:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 316 states, 180 states have (on average 1.9) internal successors, (342), 305 states have internal predecessors, (342), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-27 23:35:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 23:35:40,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:40,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 23:35:40,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 71563, now seen corresponding path program 1 times [2024-11-27 23:35:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899103797] [2024-11-27 23:35:40,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:41,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:41,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899103797] [2024-11-27 23:35:41,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899103797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:41,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:41,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135173689] [2024-11-27 23:35:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:41,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:41,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:41,974 INFO L87 Difference]: Start difference. First operand has 316 states, 180 states have (on average 1.9) internal successors, (342), 305 states have internal predecessors, (342), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-27 23:35:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:42,224 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2024-11-27 23:35:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-27 23:35:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:42,236 INFO L225 Difference]: With dead ends: 117 [2024-11-27 23:35:42,236 INFO L226 Difference]: Without dead ends: 117 [2024-11-27 23:35:42,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:42,245 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 100 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:42,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 83 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:35:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-27 23:35:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-27 23:35:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.7) internal successors, (119), 113 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-11-27 23:35:42,303 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 3 [2024-11-27 23:35:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:42,304 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-11-27 23:35:42,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-27 23:35:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-11-27 23:35:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 23:35:42,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:42,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 23:35:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:35:42,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:42,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 71564, now seen corresponding path program 1 times [2024-11-27 23:35:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921326864] [2024-11-27 23:35:42,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:42,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921326864] [2024-11-27 23:35:42,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921326864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412822] [2024-11-27 23:35:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:42,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:42,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:42,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:42,967 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-27 23:35:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:43,178 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2024-11-27 23:35:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-27 23:35:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:43,180 INFO L225 Difference]: With dead ends: 116 [2024-11-27 23:35:43,180 INFO L226 Difference]: Without dead ends: 116 [2024-11-27 23:35:43,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:43,181 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:43,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 178 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:35:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-27 23:35:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-27 23:35:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 112 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2024-11-27 23:35:43,200 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 3 [2024-11-27 23:35:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:43,201 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2024-11-27 23:35:43,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-27 23:35:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2024-11-27 23:35:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 23:35:43,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:43,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:43,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:35:43,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:43,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1665984083, now seen corresponding path program 1 times [2024-11-27 23:35:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331377296] [2024-11-27 23:35:43,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331377296] [2024-11-27 23:35:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331377296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:35:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651322490] [2024-11-27 23:35:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:43,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:35:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:43,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:35:43,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:35:43,852 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-27 23:35:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:44,138 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-11-27 23:35:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:35:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-11-27 23:35:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:44,141 INFO L225 Difference]: With dead ends: 120 [2024-11-27 23:35:44,141 INFO L226 Difference]: Without dead ends: 120 [2024-11-27 23:35:44,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:35:44,145 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:44,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 243 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:35:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-27 23:35:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-27 23:35:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-11-27 23:35:44,159 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 7 [2024-11-27 23:35:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:44,163 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-11-27 23:35:44,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-11-27 23:35:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-11-27 23:35:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:35:44,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:44,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:35:44,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1963174196, now seen corresponding path program 1 times [2024-11-27 23:35:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352908460] [2024-11-27 23:35:44,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352908460] [2024-11-27 23:35:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352908460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:35:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623802647] [2024-11-27 23:35:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:44,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:44,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:35:44,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:35:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:45,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 23:35:45,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:35:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:45,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:35:45,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-27 23:35:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623802647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:35:45,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:35:45,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-27 23:35:45,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523414020] [2024-11-27 23:35:45,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:35:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 23:35:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:45,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 23:35:45,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:35:45,588 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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-11-27 23:35:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:46,088 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2024-11-27 23:35:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:35:46,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) Word has length 11 [2024-11-27 23:35:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:46,098 INFO L225 Difference]: With dead ends: 124 [2024-11-27 23:35:46,098 INFO L226 Difference]: Without dead ends: 124 [2024-11-27 23:35:46,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-27 23:35:46,099 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 219 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:46,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 394 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:35:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-27 23:35:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-27 23:35:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2024-11-27 23:35:46,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 11 [2024-11-27 23:35:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:46,112 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2024-11-27 23:35:46,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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-11-27 23:35:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2024-11-27 23:35:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 23:35:46,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:46,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:46,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 23:35:46,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:46,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2118856001, now seen corresponding path program 1 times [2024-11-27 23:35:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22103079] [2024-11-27 23:35:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:46,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22103079] [2024-11-27 23:35:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22103079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:35:46,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036931251] [2024-11-27 23:35:46,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:46,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:46,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:46,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:35:46,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:35:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:47,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:35:47,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:35:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:47,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:35:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036931251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:35:47,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:35:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-27 23:35:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759173045] [2024-11-27 23:35:47,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:35:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:35:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:47,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:35:47,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:35:47,449 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11-27 23:35:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:47,525 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2024-11-27 23:35:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:35:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) Word has length 19 [2024-11-27 23:35:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:47,527 INFO L225 Difference]: With dead ends: 144 [2024-11-27 23:35:47,528 INFO L226 Difference]: Without dead ends: 144 [2024-11-27 23:35:47,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:35:47,529 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:47,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 349 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:35:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-27 23:35:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-27 23:35:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 140 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2024-11-27 23:35:47,537 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 19 [2024-11-27 23:35:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2024-11-27 23:35:47,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-11-27 23:35:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2024-11-27 23:35:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:35:47,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:47,539 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:47,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:35:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:47,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 465925276, now seen corresponding path program 2 times [2024-11-27 23:35:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179700749] [2024-11-27 23:35:47,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:35:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:47,830 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:35:47,830 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:35:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-27 23:35:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179700749] [2024-11-27 23:35:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179700749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:48,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:48,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:35:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210239472] [2024-11-27 23:35:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:48,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:35:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:48,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:35:48,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:48,293 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-27 23:35:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:48,436 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2024-11-27 23:35:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 39 [2024-11-27 23:35:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:48,438 INFO L225 Difference]: With dead ends: 143 [2024-11-27 23:35:48,438 INFO L226 Difference]: Without dead ends: 143 [2024-11-27 23:35:48,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:48,439 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 204 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:48,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 85 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:35:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-27 23:35:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-27 23:35:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2024-11-27 23:35:48,447 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 39 [2024-11-27 23:35:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:48,449 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2024-11-27 23:35:48,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-27 23:35:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2024-11-27 23:35:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:35:48,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:48,450 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:35:48,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:48,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash 465925277, now seen corresponding path program 1 times [2024-11-27 23:35:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807747859] [2024-11-27 23:35:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:49,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807747859] [2024-11-27 23:35:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807747859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:35:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797571585] [2024-11-27 23:35:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:49,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:35:49,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:35:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:49,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 23:35:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:35:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:49,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:35:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:35:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797571585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:35:50,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:35:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-27 23:35:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877267615] [2024-11-27 23:35:50,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:35:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 23:35:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 23:35:50,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:35:50,035 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-11-27 23:35:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:50,142 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2024-11-27 23:35:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:35:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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) Word has length 39 [2024-11-27 23:35:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:50,144 INFO L225 Difference]: With dead ends: 151 [2024-11-27 23:35:50,144 INFO L226 Difference]: Without dead ends: 151 [2024-11-27 23:35:50,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:35:50,146 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:50,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 459 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:35:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-27 23:35:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-27 23:35:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 147 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2024-11-27 23:35:50,166 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 39 [2024-11-27 23:35:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:50,170 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2024-11-27 23:35:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-11-27 23:35:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2024-11-27 23:35:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 23:35:50,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:50,171 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:50,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 23:35:50,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-27 23:35:50,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:50,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1749604081, now seen corresponding path program 2 times [2024-11-27 23:35:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311909943] [2024-11-27 23:35:50,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:35:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:50,501 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:35:50,501 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:35:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:50,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:50,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311909943] [2024-11-27 23:35:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311909943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:50,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:35:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387799702] [2024-11-27 23:35:50,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:50,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:35:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:50,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:35:50,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:35:50,916 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-27 23:35:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:51,139 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2024-11-27 23:35:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:35:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 47 [2024-11-27 23:35:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:51,141 INFO L225 Difference]: With dead ends: 150 [2024-11-27 23:35:51,141 INFO L226 Difference]: Without dead ends: 150 [2024-11-27 23:35:51,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11-27 23:35:51,142 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 302 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:51,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 62 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:35:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-27 23:35:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-27 23:35:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 146 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2024-11-27 23:35:51,150 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 47 [2024-11-27 23:35:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:51,150 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2024-11-27 23:35:51,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-27 23:35:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2024-11-27 23:35:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 23:35:51,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:51,152 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:51,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:35:51,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -417952415, now seen corresponding path program 1 times [2024-11-27 23:35:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970138193] [2024-11-27 23:35:51,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970138193] [2024-11-27 23:35:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970138193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:51,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:51,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:35:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025581946] [2024-11-27 23:35:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:35:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:51,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:35:51,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:51,733 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:51,908 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2024-11-27 23:35:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:35:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-27 23:35:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:51,911 INFO L225 Difference]: With dead ends: 145 [2024-11-27 23:35:51,912 INFO L226 Difference]: Without dead ends: 145 [2024-11-27 23:35:51,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:35:51,913 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:51,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 90 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:35:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-27 23:35:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-27 23:35:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 141 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 150 transitions. [2024-11-27 23:35:51,927 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 150 transitions. Word has length 55 [2024-11-27 23:35:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 150 transitions. [2024-11-27 23:35:51,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2024-11-27 23:35:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 23:35:51,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:51,929 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:51,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:35:51,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash -417952414, now seen corresponding path program 1 times [2024-11-27 23:35:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614940489] [2024-11-27 23:35:51,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614940489] [2024-11-27 23:35:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614940489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:35:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141245888] [2024-11-27 23:35:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:35:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:35:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:53,324 INFO L87 Difference]: Start difference. First operand 145 states and 150 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:53,628 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2024-11-27 23:35:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-27 23:35:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:53,633 INFO L225 Difference]: With dead ends: 190 [2024-11-27 23:35:53,633 INFO L226 Difference]: Without dead ends: 190 [2024-11-27 23:35:53,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:53,634 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 140 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:53,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 326 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:35:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-27 23:35:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 144. [2024-11-27 23:35:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 140 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2024-11-27 23:35:53,644 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 55 [2024-11-27 23:35:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:53,645 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2024-11-27 23:35:53,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2024-11-27 23:35:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 23:35:53,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:53,648 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:53,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:35:53,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash 880060457, now seen corresponding path program 1 times [2024-11-27 23:35:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834610020] [2024-11-27 23:35:53,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834610020] [2024-11-27 23:35:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834610020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:54,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:54,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:35:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049969967] [2024-11-27 23:35:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:54,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:35:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:54,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:35:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:35:54,604 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:55,000 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2024-11-27 23:35:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-27 23:35:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:55,002 INFO L225 Difference]: With dead ends: 165 [2024-11-27 23:35:55,002 INFO L226 Difference]: Without dead ends: 165 [2024-11-27 23:35:55,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:35:55,003 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 245 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:55,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 175 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:35:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-27 23:35:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2024-11-27 23:35:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 155 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2024-11-27 23:35:55,011 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 59 [2024-11-27 23:35:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:55,013 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2024-11-27 23:35:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2024-11-27 23:35:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 23:35:55,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:55,017 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:55,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:35:55,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 880063754, now seen corresponding path program 1 times [2024-11-27 23:35:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445955781] [2024-11-27 23:35:55,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445955781] [2024-11-27 23:35:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445955781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:35:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484380692] [2024-11-27 23:35:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:35:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:35:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:35:55,388 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:55,574 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2024-11-27 23:35:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:35:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-27 23:35:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:55,576 INFO L225 Difference]: With dead ends: 158 [2024-11-27 23:35:55,576 INFO L226 Difference]: Without dead ends: 158 [2024-11-27 23:35:55,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:35:55,577 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:55,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 152 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:35:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-27 23:35:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-27 23:35:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 154 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2024-11-27 23:35:55,583 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 59 [2024-11-27 23:35:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:55,583 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2024-11-27 23:35:55,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2024-11-27 23:35:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 23:35:55,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:55,584 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:55,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:35:55,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:55,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 880063755, now seen corresponding path program 1 times [2024-11-27 23:35:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448625367] [2024-11-27 23:35:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448625367] [2024-11-27 23:35:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448625367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:56,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:56,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:35:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460163121] [2024-11-27 23:35:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:56,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:35:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:56,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:35:56,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:56,136 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:56,239 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2024-11-27 23:35:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:56,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-27 23:35:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:56,241 INFO L225 Difference]: With dead ends: 164 [2024-11-27 23:35:56,241 INFO L226 Difference]: Without dead ends: 164 [2024-11-27 23:35:56,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:35:56,242 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:56,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 392 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:35:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-27 23:35:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2024-11-27 23:35:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 154 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2024-11-27 23:35:56,256 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 59 [2024-11-27 23:35:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:56,256 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2024-11-27 23:35:56,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2024-11-27 23:35:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 23:35:56,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:56,257 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:56,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:35:56,257 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1400729528, now seen corresponding path program 1 times [2024-11-27 23:35:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511174942] [2024-11-27 23:35:56,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:57,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511174942] [2024-11-27 23:35:57,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511174942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:57,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:57,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:35:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664282200] [2024-11-27 23:35:57,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:57,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:35:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:57,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:35:57,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:35:57,300 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:57,729 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2024-11-27 23:35:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:57,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-27 23:35:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:57,731 INFO L225 Difference]: With dead ends: 162 [2024-11-27 23:35:57,731 INFO L226 Difference]: Without dead ends: 162 [2024-11-27 23:35:57,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:35:57,732 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 156 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:57,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 165 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:35:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-27 23:35:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2024-11-27 23:35:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 153 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2024-11-27 23:35:57,738 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 62 [2024-11-27 23:35:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:57,739 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2024-11-27 23:35:57,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2024-11-27 23:35:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 23:35:57,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:57,740 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 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-11-27 23:35:57,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:35:57,741 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:57,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -768842513, now seen corresponding path program 1 times [2024-11-27 23:35:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777287708] [2024-11-27 23:35:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:35:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777287708] [2024-11-27 23:35:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777287708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:35:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:35:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:35:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025502704] [2024-11-27 23:35:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:35:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:35:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:35:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:35:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:35:58,707 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:59,032 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2024-11-27 23:35:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:35:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-27 23:35:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:59,034 INFO L225 Difference]: With dead ends: 156 [2024-11-27 23:35:59,034 INFO L226 Difference]: Without dead ends: 156 [2024-11-27 23:35:59,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:35:59,035 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 79 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:59,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 337 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:35:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-27 23:35:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-27 23:35:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 152 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2024-11-27 23:35:59,050 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 65 [2024-11-27 23:35:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:59,050 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2024-11-27 23:35:59,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:35:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2024-11-27 23:35:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 23:35:59,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:59,058 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 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-11-27 23:35:59,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 23:35:59,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:35:59,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -768842512, now seen corresponding path program 1 times [2024-11-27 23:35:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084264914] [2024-11-27 23:35:59,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084264914] [2024-11-27 23:36:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084264914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:36:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:36:00,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:36:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305100336] [2024-11-27 23:36:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:36:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:36:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:00,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:36:00,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:36:00,307 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:00,620 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2024-11-27 23:36:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:36:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-27 23:36:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:00,622 INFO L225 Difference]: With dead ends: 155 [2024-11-27 23:36:00,622 INFO L226 Difference]: Without dead ends: 155 [2024-11-27 23:36:00,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:36:00,623 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:00,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 326 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:36:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-27 23:36:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-27 23:36:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 151 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2024-11-27 23:36:00,633 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 65 [2024-11-27 23:36:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:00,633 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2024-11-27 23:36:00,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2024-11-27 23:36:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 23:36:00,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:00,635 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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-11-27 23:36:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 23:36:00,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -369047648, now seen corresponding path program 1 times [2024-11-27 23:36:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:00,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256383054] [2024-11-27 23:36:00,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:00,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256383054] [2024-11-27 23:36:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256383054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:36:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:36:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:36:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813224855] [2024-11-27 23:36:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:36:01,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:36:01,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:01,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:36:01,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:36:01,817 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:02,423 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2024-11-27 23:36:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:36:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-27 23:36:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:02,425 INFO L225 Difference]: With dead ends: 165 [2024-11-27 23:36:02,425 INFO L226 Difference]: Without dead ends: 165 [2024-11-27 23:36:02,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:36:02,426 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 157 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:02,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 417 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:36:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-27 23:36:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-11-27 23:36:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 159 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2024-11-27 23:36:02,439 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 70 [2024-11-27 23:36:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:02,439 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-27 23:36:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2024-11-27 23:36:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 23:36:02,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:02,440 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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-11-27 23:36:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 23:36:02,441 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -369047647, now seen corresponding path program 1 times [2024-11-27 23:36:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658340246] [2024-11-27 23:36:02,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658340246] [2024-11-27 23:36:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658340246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:36:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:36:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:36:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504446621] [2024-11-27 23:36:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:36:04,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:36:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:04,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:36:04,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:36:04,235 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:04,835 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2024-11-27 23:36:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:36:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-27 23:36:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:04,837 INFO L225 Difference]: With dead ends: 163 [2024-11-27 23:36:04,837 INFO L226 Difference]: Without dead ends: 163 [2024-11-27 23:36:04,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-27 23:36:04,839 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 88 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:04,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 287 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:36:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-27 23:36:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-27 23:36:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.3) internal successors, (169), 159 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2024-11-27 23:36:04,850 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 70 [2024-11-27 23:36:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:04,850 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2024-11-27 23:36:04,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2024-11-27 23:36:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 23:36:04,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:04,851 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:36:04,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 23:36:04,851 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:04,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 9632544, now seen corresponding path program 1 times [2024-11-27 23:36:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166538292] [2024-11-27 23:36:04,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166538292] [2024-11-27 23:36:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166538292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980315378] [2024-11-27 23:36:06,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:36:06,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:36:06,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:36:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:06,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 23:36:06,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:06,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 23:36:07,045 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:36:07,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:36:07,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-27 23:36:07,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-27 23:36:07,257 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-27 23:36:07,338 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-27 23:36:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-27 23:36:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:07,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:07,423 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-27 23:36:07,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-27 23:36:07,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2081 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2081) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem164#1.base|)) is different from false [2024-11-27 23:36:07,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2080) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-27 23:36:07,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int))) (not (= (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2080) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-27 23:36:07,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int))) (not (= (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~argv~0#1.base|))) is different from false [2024-11-27 23:36:07,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:07,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2024-11-27 23:36:07,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 145 [2024-11-27 23:36:07,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-27 23:36:07,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-27 23:36:07,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-27 23:36:07,777 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:36:07,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-27 23:36:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2024-11-27 23:36:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980315378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:36:07,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:36:07,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2024-11-27 23:36:07,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830359589] [2024-11-27 23:36:07,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:36:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 23:36:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:07,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 23:36:07,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=224, Unknown=4, NotChecked=132, Total=420 [2024-11-27 23:36:07,817 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:08,653 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2024-11-27 23:36:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:36:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-27 23:36:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:08,655 INFO L225 Difference]: With dead ends: 162 [2024-11-27 23:36:08,655 INFO L226 Difference]: Without dead ends: 162 [2024-11-27 23:36:08,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=328, Unknown=4, NotChecked=164, Total=600 [2024-11-27 23:36:08,656 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 166 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:08,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 567 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 360 Unchecked, 0.6s Time] [2024-11-27 23:36:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-27 23:36:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-27 23:36:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 158 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2024-11-27 23:36:08,663 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 75 [2024-11-27 23:36:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:08,663 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2024-11-27 23:36:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 21 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2024-11-27 23:36:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 23:36:08,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:08,665 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:36:08,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 23:36:08,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:08,866 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:08,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash 9632545, now seen corresponding path program 1 times [2024-11-27 23:36:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:08,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454940430] [2024-11-27 23:36:08,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:11,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454940430] [2024-11-27 23:36:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454940430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:11,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639334049] [2024-11-27 23:36:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:36:11,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:36:11,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:36:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:11,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-27 23:36:11,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 23:36:11,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:36:11,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:36:12,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 23:36:12,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-27 23:36:12,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-27 23:36:12,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-27 23:36:12,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 23:36:12,313 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:12,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-27 23:36:12,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 23:36:12,515 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:12,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-27 23:36:12,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 23:36:12,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-27 23:36:12,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 23:36:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:12,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:12,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2366 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-27 23:36:12,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2366 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-27 23:36:12,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2366 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-27 23:36:12,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2365))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2364) .cse0 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2364) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2024-11-27 23:36:12,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2365))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2364) .cse1 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2364) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2024-11-27 23:36:13,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2362))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2365))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2363) .cse0 v_ArrVal_2364) .cse1 v_ArrVal_2366) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2362))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2363) .cse5 v_ArrVal_2364) (select (select (store .cse6 .cse5 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2366))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2024-11-27 23:36:13,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2024-11-27 23:36:13,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:13,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2024-11-27 23:36:13,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5070 treesize of output 4134 [2024-11-27 23:36:13,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9258 treesize of output 8962 [2024-11-27 23:36:13,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 176 [2024-11-27 23:36:13,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 164 [2024-11-27 23:36:13,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 128 [2024-11-27 23:36:13,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2024-11-27 23:36:13,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2024-11-27 23:36:13,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-27 23:36:13,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:13,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2024-11-27 23:36:13,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:13,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2024-11-27 23:36:13,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:13,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 61 [2024-11-27 23:36:13,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:13,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:13,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-27 23:36:13,554 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:36:13,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-27 23:36:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-27 23:36:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639334049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:36:13,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:36:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2024-11-27 23:36:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777740103] [2024-11-27 23:36:13,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:36:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-27 23:36:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:13,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-27 23:36:13,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=553, Unknown=6, NotChecked=318, Total=992 [2024-11-27 23:36:13,572 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:15,421 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2024-11-27 23:36:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:36:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-27 23:36:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:15,424 INFO L225 Difference]: With dead ends: 172 [2024-11-27 23:36:15,424 INFO L226 Difference]: Without dead ends: 172 [2024-11-27 23:36:15,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=864, Unknown=6, NotChecked=402, Total=1482 [2024-11-27 23:36:15,425 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 102 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:15,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 778 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 806 Invalid, 0 Unknown, 607 Unchecked, 1.1s Time] [2024-11-27 23:36:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-27 23:36:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-27 23:36:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 168 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 181 transitions. [2024-11-27 23:36:15,433 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 181 transitions. Word has length 75 [2024-11-27 23:36:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:15,433 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 181 transitions. [2024-11-27 23:36:15,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 181 transitions. [2024-11-27 23:36:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-27 23:36:15,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:15,435 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 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] [2024-11-27 23:36:15,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 23:36:15,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:15,639 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:15,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 383055777, now seen corresponding path program 2 times [2024-11-27 23:36:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312439670] [2024-11-27 23:36:15,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:36:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:15,796 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:36:15,796 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:36:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312439670] [2024-11-27 23:36:18,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312439670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877581654] [2024-11-27 23:36:18,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:36:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:18,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:36:18,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:36:18,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:36:19,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:36:19,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:36:19,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-27 23:36:19,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:19,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 23:36:19,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:36:19,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:36:19,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 23:36:19,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-27 23:36:19,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-27 23:36:19,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-27 23:36:19,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 23:36:19,475 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:19,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-27 23:36:19,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 23:36:19,678 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:19,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-27 23:36:19,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 23:36:19,892 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 23:36:19,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-27 23:36:19,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 23:36:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-27 23:36:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-27 23:36:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:20,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:20,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2666 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2024-11-27 23:36:20,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2665))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2664) .cse0 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2664) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-11-27 23:36:20,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2665))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2664) .cse1 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2664) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-27 23:36:20,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2664) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2665))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2664) .cse2 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-27 23:36:20,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2663))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2662) .cse0 v_ArrVal_2664) (select (select (store .cse1 .cse0 v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2666))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2663))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2665))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_2662) .cse3 v_ArrVal_2664) .cse4 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-27 23:36:20,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2663))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2665))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2662) .cse1 v_ArrVal_2664) .cse2 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2663))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2662) .cse6 v_ArrVal_2664) (select (select (store .cse7 .cse6 v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2666))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2)))))) is different from false [2024-11-27 23:36:20,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2661))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2663))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2660) .cse0 v_ArrVal_2662) .cse1 v_ArrVal_2664) (select (select (store .cse2 .cse1 v_ArrVal_2665) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2666))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2665 (Array Int Int)) (v_ArrVal_2664 (Array Int Int)) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2661))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2663))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2665))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2660) .cse5 v_ArrVal_2662) .cse6 v_ArrVal_2664) .cse7 v_ArrVal_2666) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-27 23:36:20,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:20,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2024-11-27 23:36:21,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2024-11-27 23:36:21,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229170 treesize of output 189850 [2024-11-27 23:36:21,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293976 treesize of output 289568 [2024-11-27 23:36:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 415 [2024-11-27 23:36:21,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 872 treesize of output 848 [2024-11-27 23:36:21,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 848 treesize of output 692 [2024-11-27 23:36:21,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 692 treesize of output 644 [2024-11-27 23:36:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 644 treesize of output 500 [2024-11-27 23:36:21,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 476 [2024-11-27 23:36:21,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 428 [2024-11-27 23:36:21,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 416 [2024-11-27 23:36:23,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:23,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2024-11-27 23:36:23,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:23,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2024-11-27 23:36:23,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:23,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 347 [2024-11-27 23:36:23,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:23,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:36:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-27 23:36:23,324 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:36:23,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-27 23:36:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 10 not checked. [2024-11-27 23:36:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877581654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:36:23,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:36:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2024-11-27 23:36:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955211266] [2024-11-27 23:36:23,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:36:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 23:36:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 23:36:23,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=856, Unknown=15, NotChecked=462, Total=1482 [2024-11-27 23:36:23,347 INFO L87 Difference]: Start difference. First operand 172 states and 181 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:25,959 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2024-11-27 23:36:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:36:25,960 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2024-11-27 23:36:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:25,962 INFO L225 Difference]: With dead ends: 192 [2024-11-27 23:36:25,963 INFO L226 Difference]: Without dead ends: 192 [2024-11-27 23:36:25,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=320, Invalid=1584, Unknown=16, NotChecked=630, Total=2550 [2024-11-27 23:36:25,966 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 300 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 15 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 797 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:25,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 686 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 784 Invalid, 27 Unknown, 797 Unchecked, 1.3s Time] [2024-11-27 23:36:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-27 23:36:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-27 23:36:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.2625) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2024-11-27 23:36:25,974 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 80 [2024-11-27 23:36:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:25,974 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2024-11-27 23:36:25,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2024-11-27 23:36:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 23:36:25,975 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:25,976 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 3, 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] [2024-11-27 23:36:25,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 23:36:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-27 23:36:26,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2061320430, now seen corresponding path program 1 times [2024-11-27 23:36:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712665423] [2024-11-27 23:36:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712665423] [2024-11-27 23:36:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712665423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201497345] [2024-11-27 23:36:26,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:36:26,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:36:26,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:36:26,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:36:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:36:27,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 23:36:27,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:27,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201497345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:36:27,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:36:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-27 23:36:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324522319] [2024-11-27 23:36:27,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:36:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:36:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:36:27,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:36:27,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:36:27,319 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:36:27,404 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2024-11-27 23:36:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:36:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-27 23:36:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:36:27,410 INFO L225 Difference]: With dead ends: 233 [2024-11-27 23:36:27,414 INFO L226 Difference]: Without dead ends: 233 [2024-11-27 23:36:27,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:36:27,416 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:36:27,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 223 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:36:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-27 23:36:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2024-11-27 23:36:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 222 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2024-11-27 23:36:27,427 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 86 [2024-11-27 23:36:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:36:27,427 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2024-11-27 23:36:27,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:36:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2024-11-27 23:36:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 23:36:27,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:36:27,429 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:36:27,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:36:27,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:27,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-27 23:36:27,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:36:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 741156769, now seen corresponding path program 3 times [2024-11-27 23:36:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:36:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271134358] [2024-11-27 23:36:27,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:36:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:36:28,253 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-27 23:36:28,254 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:36:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:36:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271134358] [2024-11-27 23:36:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271134358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:36:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704931143] [2024-11-27 23:36:34,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:36:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:36:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:36:34,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:36:34,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4dba247-016d-4f41-badd-a42d1aa95e81/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:36:39,771 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-27 23:36:39,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:36:39,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-27 23:36:39,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:39,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 23:36:39,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 23:36:39,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 23:36:39,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 23:36:40,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:36:40,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:36:40,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-27 23:36:40,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:36:40,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:36:40,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 23:36:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 23:36:40,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:36:40,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 23:36:40,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 23:36:40,873 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 23:36:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 23:36:40,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 23:36:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 46 [2024-11-27 23:36:41,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-27 23:36:41,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-11-27 23:36:41,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 23:36:41,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 23:36:41,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 23:36:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 23:36:41,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:36:41,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3298 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_3297 (Array Int Int))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem164#1.offset| |c_ULTIMATE.start_main_~j~0#1|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base|) .cse1 (select v_ArrVal_3297 .cse1))) v_ArrVal_3297)) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-27 23:36:42,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3297 (Array Int Int))) (or (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse2 (select v_ArrVal_3297 .cse2))) v_ArrVal_3297)))) (forall ((v_ArrVal_3298 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-27 23:36:42,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3297 (Array Int Int))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 (select v_ArrVal_3297 .cse1))) v_ArrVal_3297)) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_3298 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-27 23:36:43,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3293))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) 1))) (or (< .cse0 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3292))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (= v_ArrVal_3296 (store (select .cse1 .cse2) .cse0 (select v_ArrVal_3296 .cse0)))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse3 (store .cse1 .cse2 v_ArrVal_3296))) (let ((.cse6 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse0 v_ArrVal_3295))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_3297 .cse5))) v_ArrVal_3297)) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse6 .cse4 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) 4) (select |c_#length| (select (select (store .cse3 .cse4 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))))) (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3293))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) 1))) (or (< .cse9 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3292))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store .cse10 .cse11 (store (select .cse10 .cse11) .cse9 v_ArrVal_3295)) (select (select (store .cse12 .cse11 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (= v_ArrVal_3296 (store (select .cse12 .cse11) .cse9 (select v_ArrVal_3296 .cse9)))))))))))))) is different from false [2024-11-27 23:36:43,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3293))) (let ((.cse0 (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< .cse0 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3292))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (not (= v_ArrVal_3296 (store (select .cse1 .cse2) .cse0 (select v_ArrVal_3296 .cse0)))) (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ (select (select (store (store .cse3 .cse2 (store (select .cse3 .cse2) .cse0 v_ArrVal_3295)) (select (select (store .cse1 .cse2 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 3))))))))))) (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3293))) (let ((.cse6 (+ (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< .cse6 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3292))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse7 (store .cse13 .cse12 v_ArrVal_3296))) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse6 v_ArrVal_3295))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (not (= v_ArrVal_3297 (let ((.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 2))) (store (select .cse7 .cse8) .cse9 (select v_ArrVal_3297 .cse9))))) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ (select (select (store .cse10 .cse8 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse7 .cse8 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))) (not (= v_ArrVal_3296 (store (select .cse13 .cse12) .cse6 (select v_ArrVal_3296 .cse6))))))))))))))) is different from false [2024-11-27 23:36:44,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3293))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 2))) (or (< .cse0 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3292))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_3295)) (select (select (store .cse3 .cse2 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 4))) (not (= v_ArrVal_3296 (store (select .cse3 .cse2) .cse0 (select v_ArrVal_3296 .cse0)))))))))))) (forall ((v_ArrVal_3293 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3293))) (let ((.cse6 (+ (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 2))) (or (< .cse6 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3292))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (not (= v_ArrVal_3296 (store (select .cse7 .cse8) .cse6 (select v_ArrVal_3296 .cse6)))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse9 (store .cse7 .cse8 v_ArrVal_3296))) (let ((.cse12 (store .cse13 .cse8 (store (select .cse13 .cse8) .cse6 v_ArrVal_3295))) (.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (not (= v_ArrVal_3297 (let ((.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_3297 .cse11))))) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ (select (select (store .cse12 .cse10 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse9 .cse10 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))))))))) is different from false [2024-11-27 23:36:44,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3290))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3291) .cse10 v_ArrVal_3293))) (let ((.cse2 (+ (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) |c_ULTIMATE.start_main_~j~0#1| 2))) (or (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse0 (store .cse9 .cse10 v_ArrVal_3292))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3296 .cse2)) v_ArrVal_3296)) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse6 (store .cse0 .cse1 v_ArrVal_3296))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse3 (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_3295)))) (or (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse3 .cse4 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (not (= v_ArrVal_3297 (let ((.cse7 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (store (select .cse6 .cse4) .cse7 (select v_ArrVal_3297 .cse7))))))))))))) (< .cse2 0))))))) (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3290))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3291) .cse16 v_ArrVal_3293))) (let ((.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) |c_ULTIMATE.start_main_~j~0#1| 2))) (or (< .cse11 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_3292))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) .cse11 v_ArrVal_3295)) (select (select (store .cse14 .cse13 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (not (= (store (select .cse14 .cse13) .cse11 (select v_ArrVal_3296 .cse11)) v_ArrVal_3296)))))))))))))) is different from false [2024-11-27 23:36:44,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3290))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3291) .cse10 v_ArrVal_3293))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (or (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse0 (store .cse9 .cse10 v_ArrVal_3292))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= v_ArrVal_3296 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3296 .cse2)))) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse6 (store .cse0 .cse1 v_ArrVal_3296))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse3 (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_3295)))) (or (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse3 .cse4 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (not (= (let ((.cse7 (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) |c_ULTIMATE.start_main_~j~0#1| 3))) (store (select .cse6 .cse4) .cse7 (select v_ArrVal_3297 .cse7))) v_ArrVal_3297)))))))))) (< .cse2 0))))))) (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3290))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3291) .cse17 v_ArrVal_3293))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (or (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_3292))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3295)) (select (select (store .cse15 .cse13 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (not (= v_ArrVal_3296 (store (select .cse15 .cse13) .cse14 (select v_ArrVal_3296 .cse14)))))))) (< .cse14 0)))))))))) is different from false [2024-11-27 23:36:45,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_3288))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_3290))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_3289) .cse11 v_ArrVal_3291) .cse10 v_ArrVal_3293))) (let ((.cse0 (+ (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 2))) (or (< .cse0 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse1 (store .cse8 .cse7 v_ArrVal_3296))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse0 v_ArrVal_3295))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= v_ArrVal_3297 (let ((.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 3))) (store (select .cse1 .cse2) .cse3 (select v_ArrVal_3297 .cse3))))) (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ 5 (select (select (store .cse4 .cse2 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))) (not (= v_ArrVal_3296 (store (select .cse8 .cse7) .cse0 (select v_ArrVal_3296 .cse0)))))))))))))))) (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_3288))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store .cse20 .cse19 v_ArrVal_3290))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem163#1.base| v_ArrVal_3289) .cse19 v_ArrVal_3291) .cse18 v_ArrVal_3293))) (let ((.cse15 (+ (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 2))) (or (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse16 (store .cse17 .cse18 v_ArrVal_3292))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ (select (select (store (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_3295)) (select (select (store .cse16 .cse14 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (not (= v_ArrVal_3296 (store (select .cse16 .cse14) .cse15 (select v_ArrVal_3296 .cse15)))))))) (< .cse15 0))))))))))) is different from false [2024-11-27 23:36:45,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3288))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse9 (store .cse13 .cse12 v_ArrVal_3290))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3289) .cse12 v_ArrVal_3291) .cse10 v_ArrVal_3293))) (let ((.cse0 (+ 2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (or (< .cse0 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse1 (store .cse9 .cse10 v_ArrVal_3292))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= (store (select .cse1 .cse2) .cse0 (select v_ArrVal_3296 .cse0)) v_ArrVal_3296)) (forall ((v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3295 Int)) (let ((.cse6 (store .cse1 .cse2 v_ArrVal_3296))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse3 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse0 v_ArrVal_3295)))) (or (forall ((v_ArrVal_3298 (Array Int Int))) (<= (+ 5 (select (select (store .cse3 .cse4 v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_3297) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (not (= (let ((.cse7 (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 3))) (store (select .cse6 .cse4) .cse7 (select v_ArrVal_3297 .cse7))) v_ArrVal_3297)))))))))))))))))) (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_3288))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_3290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_3289) .cse20 v_ArrVal_3291) .cse19 v_ArrVal_3293))) (let ((.cse14 (+ 2 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (or (< .cse14 0) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3292 (Array Int Int))) (let ((.cse15 (store .cse18 .cse19 v_ArrVal_3292))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (= (store (select .cse15 .cse16) .cse14 (select v_ArrVal_3296 .cse14)) v_ArrVal_3296)) (forall ((v_ArrVal_3298 (Array Int Int)) (v_ArrVal_3295 Int)) (<= 0 (+ (select (select (store (store .cse17 .cse16 (store (select .cse17 .cse16) .cse14 v_ArrVal_3295)) (select (select (store .cse15 .cse16 v_ArrVal_3296) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3298) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4)))))))))))))))))) is different from false [2024-11-27 23:36:47,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:47,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 6204 treesize of output 6072 [2024-11-27 23:36:47,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:36:47,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 6060 treesize of output 3336 [2024-11-27 23:47:36,414 WARN L286 SmtUtils]: Spent 8.09m on a formula simplification that was a NOOP. DAG size: 109 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:47:36,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:47:36,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 22811738814625 treesize of output 21737263888213 [2024-11-27 23:48:37,367 WARN L286 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 110682 DAG size of output: 902 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)