./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/echo-1.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_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/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_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/echo-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/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_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/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 c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:02:35,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:02:35,225 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 03:02:35,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:02:35,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:02:35,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:02:35,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:02:35,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:02:35,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:02:35,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:02:35,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:02:35,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:02:35,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:02:35,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:02:35,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:02:35,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:02:35,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:02:35,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:02:35,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:02:35,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:02:35,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:02:35,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:02:35,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:02:35,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:02:35,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:02:35,271 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_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/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 -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2024-11-28 03:02:35,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:02:35,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:02:35,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:02:35,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:02:35,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:02:35,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2024-11-28 03:02:38,505 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/data/f4f695087/2be423e6795e460da8e9e7b66dddaa97/FLAGa9d334df1 [2024-11-28 03:02:39,022 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:02:39,023 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2024-11-28 03:02:39,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/data/f4f695087/2be423e6795e460da8e9e7b66dddaa97/FLAGa9d334df1 [2024-11-28 03:02:39,569 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/data/f4f695087/2be423e6795e460da8e9e7b66dddaa97 [2024-11-28 03:02:39,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:02:39,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:02:39,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:02:39,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:02:39,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:02:39,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:39" (1/1) ... [2024-11-28 03:02:39,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c09f831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:39, skipping insertion in model container [2024-11-28 03:02:39,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:39" (1/1) ... [2024-11-28 03:02:39,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:02:40,719 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-28 03:02:40,727 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-28 03:02:40,744 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-28 03:02:40,746 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-28 03:02:40,747 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-28 03:02:40,748 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-28 03:02:40,748 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-28 03:02:40,750 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-28 03:02:40,750 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-28 03:02:40,751 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-28 03:02:40,756 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-28 03:02:40,757 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-28 03:02:40,763 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-28 03:02:40,769 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-28 03:02:40,770 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-28 03:02:40,774 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-28 03:02:40,783 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-28 03:02:40,785 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-28 03:02:40,786 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-28 03:02:40,790 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-28 03:02:40,791 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-28 03:02:40,801 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-28 03:02:40,812 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-28 03:02:40,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:02:40,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:02:40,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:02:41,241 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-28 03:02:41,248 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:02:41,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41 WrapperNode [2024-11-28 03:02:41,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:02:41,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:02:41,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:02:41,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:02:41,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,354 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1071 [2024-11-28 03:02:41,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:02:41,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:02:41,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:02:41,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:02:41,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,409 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 03:02:41,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:02:41,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:02:41,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:02:41,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:02:41,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (1/1) ... [2024-11-28 03:02:41,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:02:41,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:41,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:02:41,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:02:41,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:02:41,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-28 03:02:41,628 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2024-11-28 03:02:41,629 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2024-11-28 03:02:41,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 03:02:41,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:02:41,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:02:41,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:02:41,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:02:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-28 03:02:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:02:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2024-11-28 03:02:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2024-11-28 03:02:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:02:42,077 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:02:42,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:02:47,812 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2024-11-28 03:02:47,813 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:02:47,835 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:02:47,835 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-28 03:02:47,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:47 BoogieIcfgContainer [2024-11-28 03:02:47,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:02:47,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:02:47,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:02:47,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:02:47,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:02:39" (1/3) ... [2024-11-28 03:02:47,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7556a12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:02:47, skipping insertion in model container [2024-11-28 03:02:47,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:41" (2/3) ... [2024-11-28 03:02:47,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7556a12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:02:47, skipping insertion in model container [2024-11-28 03:02:47,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:47" (3/3) ... [2024-11-28 03:02:47,847 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2024-11-28 03:02:47,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:02:47,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 448 locations, 1 initial locations, 19 loop locations, and 175 error locations. [2024-11-28 03:02:47,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:02:47,926 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;@2dee5ece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:02:47,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 175 error locations. [2024-11-28 03:02:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 259 states have (on average 1.9922779922779923) internal successors, (516), 434 states have internal predecessors, (516), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-28 03:02:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:02:47,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:47,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:02:47,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:02:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 326765, now seen corresponding path program 1 times [2024-11-28 03:02:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656338278] [2024-11-28 03:02:47,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:49,517 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-28 03:02:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656338278] [2024-11-28 03:02:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656338278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:02:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:02:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:02:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008530543] [2024-11-28 03:02:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:02:49,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:02:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:02:49,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:02:49,555 INFO L87 Difference]: Start difference. First operand has 448 states, 259 states have (on average 1.9922779922779923) internal successors, (516), 434 states have internal predecessors, (516), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-28 03:02:53,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:02:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:54,004 INFO L93 Difference]: Finished difference Result 302 states and 344 transitions. [2024-11-28 03:02:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:02:54,007 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-28 03:02:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:54,017 INFO L225 Difference]: With dead ends: 302 [2024-11-28 03:02:54,017 INFO L226 Difference]: Without dead ends: 300 [2024-11-28 03:02:54,019 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-28 03:02:54,022 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 12 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:54,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 561 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 03:02:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-28 03:02:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-28 03:02:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 182 states have (on average 1.8241758241758241) internal successors, (332), 291 states have internal predecessors, (332), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:02:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 342 transitions. [2024-11-28 03:02:54,095 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 342 transitions. Word has length 3 [2024-11-28 03:02:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:54,096 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 342 transitions. [2024-11-28 03:02:54,096 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-28 03:02:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 342 transitions. [2024-11-28 03:02:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:02:54,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:54,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:02:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:02:54,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:02:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 326764, now seen corresponding path program 1 times [2024-11-28 03:02:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775196926] [2024-11-28 03:02:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:54,818 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-28 03:02:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775196926] [2024-11-28 03:02:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775196926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:02:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:02:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:02:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755391293] [2024-11-28 03:02:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:02:54,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:02:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:54,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:02:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:02:54,821 INFO L87 Difference]: Start difference. First operand 300 states and 342 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-28 03:02:58,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:02:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:59,367 INFO L93 Difference]: Finished difference Result 411 states and 474 transitions. [2024-11-28 03:02:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:02:59,368 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-28 03:02:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:59,370 INFO L225 Difference]: With dead ends: 411 [2024-11-28 03:02:59,370 INFO L226 Difference]: Without dead ends: 411 [2024-11-28 03:02:59,370 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-28 03:02:59,371 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 228 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:59,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 407 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 03:02:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-28 03:02:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 298. [2024-11-28 03:02:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 182 states have (on average 1.8131868131868132) internal successors, (330), 289 states have internal predecessors, (330), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:02:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 340 transitions. [2024-11-28 03:02:59,387 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 340 transitions. Word has length 3 [2024-11-28 03:02:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:59,387 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 340 transitions. [2024-11-28 03:02:59,387 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-28 03:02:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 340 transitions. [2024-11-28 03:02:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 03:02:59,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:59,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:59,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:02:59,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:02:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1134177012, now seen corresponding path program 1 times [2024-11-28 03:02:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972621939] [2024-11-28 03:02:59,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:00,409 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-28 03:03:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972621939] [2024-11-28 03:03:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972621939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414300489] [2024-11-28 03:03:00,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:03:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:00,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:03:00,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:03:00,413 INFO L87 Difference]: Start difference. First operand 298 states and 340 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-28 03:03:04,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:08,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:09,050 INFO L93 Difference]: Finished difference Result 302 states and 344 transitions. [2024-11-28 03:03:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:03:09,051 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-28 03:03:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:09,053 INFO L225 Difference]: With dead ends: 302 [2024-11-28 03:03:09,053 INFO L226 Difference]: Without dead ends: 302 [2024-11-28 03:03:09,053 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-28 03:03:09,054 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 12 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:09,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 784 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-28 03:03:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-28 03:03:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2024-11-28 03:03:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 185 states have (on average 1.8) internal successors, (333), 292 states have internal predecessors, (333), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:03:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 343 transitions. [2024-11-28 03:03:09,069 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 343 transitions. Word has length 7 [2024-11-28 03:03:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:09,069 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 343 transitions. [2024-11-28 03:03:09,070 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-28 03:03:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 343 transitions. [2024-11-28 03:03:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:03:09,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:09,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:09,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:03:09,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:09,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1146952493, now seen corresponding path program 1 times [2024-11-28 03:03:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:09,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770921226] [2024-11-28 03:03:09,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:10,178 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-28 03:03:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770921226] [2024-11-28 03:03:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770921226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476431950] [2024-11-28 03:03:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:10,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:10,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:10,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:03:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:10,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:03:10,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:11,248 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-28 03:03:11,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:11,488 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-28 03:03:11,519 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-28 03:03:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476431950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:03:11,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:03:11,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-28 03:03:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028198188] [2024-11-28 03:03:11,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:11,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:03:11,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:11,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:03:11,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:03:11,521 INFO L87 Difference]: Start difference. First operand 301 states and 343 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-28 03:03:15,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:19,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:23,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:27,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:28,975 INFO L93 Difference]: Finished difference Result 306 states and 348 transitions. [2024-11-28 03:03:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:03:28,977 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-28 03:03:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:28,978 INFO L225 Difference]: With dead ends: 306 [2024-11-28 03:03:28,978 INFO L226 Difference]: Without dead ends: 306 [2024-11-28 03:03:28,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:03:28,979 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 296 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:28,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1432 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 540 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2024-11-28 03:03:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-28 03:03:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-28 03:03:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 191 states have (on average 1.7696335078534031) internal successors, (338), 297 states have internal predecessors, (338), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:03:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 348 transitions. [2024-11-28 03:03:29,000 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 348 transitions. Word has length 11 [2024-11-28 03:03:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 348 transitions. [2024-11-28 03:03:29,000 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-28 03:03:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 348 transitions. [2024-11-28 03:03:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:03:29,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:29,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:29,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:03:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:29,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1755646304, now seen corresponding path program 1 times [2024-11-28 03:03:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949508142] [2024-11-28 03:03:29,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:29,937 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-28 03:03:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949508142] [2024-11-28 03:03:29,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949508142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:29,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052855639] [2024-11-28 03:03:29,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:29,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:03:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:03:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:30,813 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-28 03:03:30,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:30,974 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-28 03:03:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052855639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:03:30,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:03:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-28 03:03:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211548202] [2024-11-28 03:03:30,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:03:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:30,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:03:30,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:03:30,977 INFO L87 Difference]: Start difference. First operand 306 states and 348 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-28 03:03:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:31,100 INFO L93 Difference]: Finished difference Result 326 states and 368 transitions. [2024-11-28 03:03:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:03:31,101 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-28 03:03:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:31,102 INFO L225 Difference]: With dead ends: 326 [2024-11-28 03:03:31,102 INFO L226 Difference]: Without dead ends: 326 [2024-11-28 03:03:31,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:03:31,103 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 6 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:31,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1668 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:03:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-28 03:03:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-28 03:03:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 211 states have (on average 1.6966824644549763) internal successors, (358), 317 states have internal predecessors, (358), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:03:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 368 transitions. [2024-11-28 03:03:31,114 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 368 transitions. Word has length 19 [2024-11-28 03:03:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:31,114 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 368 transitions. [2024-11-28 03:03:31,114 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-28 03:03:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 368 transitions. [2024-11-28 03:03:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:03:31,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:31,119 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:31,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:03:31,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:31,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:31,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2106210109, now seen corresponding path program 2 times [2024-11-28 03:03:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249566521] [2024-11-28 03:03:31,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:03:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:31,748 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:03:31,748 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:03:32,230 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-28 03:03:32,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:32,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249566521] [2024-11-28 03:03:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249566521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:03:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949619956] [2024-11-28 03:03:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:32,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:03:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:32,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:03:32,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:03:32,232 INFO L87 Difference]: Start difference. First operand 326 states and 368 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-28 03:03:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:33,211 INFO L93 Difference]: Finished difference Result 468 states and 536 transitions. [2024-11-28 03:03:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:33,212 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-28 03:03:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:33,214 INFO L225 Difference]: With dead ends: 468 [2024-11-28 03:03:33,214 INFO L226 Difference]: Without dead ends: 468 [2024-11-28 03:03:33,215 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-28 03:03:33,215 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 265 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:33,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 892 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:03:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-28 03:03:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 377. [2024-11-28 03:03:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 259 states have (on average 1.6988416988416988) internal successors, (440), 365 states have internal predecessors, (440), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:03:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 454 transitions. [2024-11-28 03:03:33,227 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 454 transitions. Word has length 39 [2024-11-28 03:03:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 454 transitions. [2024-11-28 03:03:33,228 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-28 03:03:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 454 transitions. [2024-11-28 03:03:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:03:33,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:33,229 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:03:33,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2106210110, now seen corresponding path program 1 times [2024-11-28 03:03:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517156481] [2024-11-28 03:03:33,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:34,226 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-28 03:03:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517156481] [2024-11-28 03:03:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517156481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:03:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181570091] [2024-11-28 03:03:34,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:03:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:34,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:03:34,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:03:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:35,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:03:35,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:35,254 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-28 03:03:35,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:35,523 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-28 03:03:35,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181570091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:03:35,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:03:35,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-28 03:03:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659090524] [2024-11-28 03:03:35,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:03:35,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:03:35,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:35,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:03:35,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:03:35,525 INFO L87 Difference]: Start difference. First operand 377 states and 454 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-28 03:03:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:35,641 INFO L93 Difference]: Finished difference Result 385 states and 462 transitions. [2024-11-28 03:03:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:03:35,642 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-28 03:03:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:35,645 INFO L225 Difference]: With dead ends: 385 [2024-11-28 03:03:35,645 INFO L226 Difference]: Without dead ends: 385 [2024-11-28 03:03:35,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:03:35,646 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 3 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:35,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1994 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:03:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-28 03:03:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2024-11-28 03:03:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 267 states have (on average 1.6779026217228465) internal successors, (448), 373 states have internal predecessors, (448), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:03:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 462 transitions. [2024-11-28 03:03:35,657 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 462 transitions. Word has length 39 [2024-11-28 03:03:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:35,658 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 462 transitions. [2024-11-28 03:03:35,658 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-28 03:03:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 462 transitions. [2024-11-28 03:03:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:03:35,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:35,659 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:35,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:03:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 03:03:35,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:35,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 973015856, now seen corresponding path program 2 times [2024-11-28 03:03:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54890246] [2024-11-28 03:03:35,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:03:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:36,242 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:03:36,242 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:03:36,834 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-28 03:03:36,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54890246] [2024-11-28 03:03:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54890246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:36,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799599791] [2024-11-28 03:03:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:36,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:03:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:03:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:03:36,836 INFO L87 Difference]: Start difference. First operand 385 states and 462 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-28 03:03:40,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:41,809 INFO L93 Difference]: Finished difference Result 603 states and 685 transitions. [2024-11-28 03:03:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:03:41,809 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-28 03:03:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:41,812 INFO L225 Difference]: With dead ends: 603 [2024-11-28 03:03:41,812 INFO L226 Difference]: Without dead ends: 603 [2024-11-28 03:03:41,812 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-28 03:03:41,813 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 738 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:41,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 550 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 03:03:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-28 03:03:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 388. [2024-11-28 03:03:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 270 states have (on average 1.6703703703703703) internal successors, (451), 375 states have internal predecessors, (451), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:03:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 465 transitions. [2024-11-28 03:03:41,825 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 465 transitions. Word has length 47 [2024-11-28 03:03:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:41,826 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 465 transitions. [2024-11-28 03:03:41,826 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-28 03:03:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 465 transitions. [2024-11-28 03:03:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:03:41,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:41,827 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-28 03:03:41,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:03:41,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:41,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1519598476, now seen corresponding path program 1 times [2024-11-28 03:03:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267404037] [2024-11-28 03:03:41,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:42,526 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-28 03:03:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267404037] [2024-11-28 03:03:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267404037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:42,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:03:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024823298] [2024-11-28 03:03:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:42,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:42,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:42,529 INFO L87 Difference]: Start difference. First operand 388 states and 465 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-28 03:03:46,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:46,973 INFO L93 Difference]: Finished difference Result 466 states and 535 transitions. [2024-11-28 03:03:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:46,974 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-28 03:03:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:46,976 INFO L225 Difference]: With dead ends: 466 [2024-11-28 03:03:46,976 INFO L226 Difference]: Without dead ends: 466 [2024-11-28 03:03:46,976 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-28 03:03:46,976 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 206 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:46,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 414 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 03:03:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-28 03:03:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 383. [2024-11-28 03:03:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 270 states have (on average 1.651851851851852) internal successors, (446), 370 states have internal predecessors, (446), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:03:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 460 transitions. [2024-11-28 03:03:46,988 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 460 transitions. Word has length 55 [2024-11-28 03:03:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 460 transitions. [2024-11-28 03:03:46,988 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-28 03:03:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 460 transitions. [2024-11-28 03:03:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:03:46,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:46,989 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-28 03:03:46,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:03:46,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1519598477, now seen corresponding path program 1 times [2024-11-28 03:03:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627301754] [2024-11-28 03:03:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:48,395 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-28 03:03:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627301754] [2024-11-28 03:03:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627301754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:03:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800300853] [2024-11-28 03:03:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:03:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:03:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:03:48,397 INFO L87 Difference]: Start difference. First operand 383 states and 460 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-28 03:03:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:49,008 INFO L93 Difference]: Finished difference Result 425 states and 510 transitions. [2024-11-28 03:03:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:03:49,009 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-28 03:03:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:49,011 INFO L225 Difference]: With dead ends: 425 [2024-11-28 03:03:49,012 INFO L226 Difference]: Without dead ends: 425 [2024-11-28 03:03:49,012 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-28 03:03:49,013 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 355 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:49,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1131 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:03:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-28 03:03:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 382. [2024-11-28 03:03:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.6481481481481481) internal successors, (445), 369 states have internal predecessors, (445), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:03:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 459 transitions. [2024-11-28 03:03:49,026 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 459 transitions. Word has length 55 [2024-11-28 03:03:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 459 transitions. [2024-11-28 03:03:49,026 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-28 03:03:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 459 transitions. [2024-11-28 03:03:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 03:03:49,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:49,027 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-28 03:03:49,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:03:49,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:03:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 549519636, now seen corresponding path program 1 times [2024-11-28 03:03:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952401248] [2024-11-28 03:03:49,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:50,082 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-28 03:03:50,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:03:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952401248] [2024-11-28 03:03:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952401248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:50,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:03:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936229055] [2024-11-28 03:03:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:50,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:03:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:03:50,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:03:50,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:03:50,084 INFO L87 Difference]: Start difference. First operand 382 states and 459 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-28 03:03:54,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:58,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:02,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:06,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:07,907 INFO L93 Difference]: Finished difference Result 485 states and 557 transitions. [2024-11-28 03:04:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:04:07,908 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-28 03:04:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:07,910 INFO L225 Difference]: With dead ends: 485 [2024-11-28 03:04:07,910 INFO L226 Difference]: Without dead ends: 485 [2024-11-28 03:04:07,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:04:07,911 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 445 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:07,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 854 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 662 Invalid, 4 Unknown, 0 Unchecked, 17.7s Time] [2024-11-28 03:04:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-28 03:04:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 396. [2024-11-28 03:04:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 285 states have (on average 1.6385964912280702) internal successors, (467), 383 states have internal predecessors, (467), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 481 transitions. [2024-11-28 03:04:07,923 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 481 transitions. Word has length 59 [2024-11-28 03:04:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:07,923 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 481 transitions. [2024-11-28 03:04:07,924 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-28 03:04:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 481 transitions. [2024-11-28 03:04:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 03:04:07,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:07,925 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] [2024-11-28 03:04:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:04:07,925 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -144657807, now seen corresponding path program 1 times [2024-11-28 03:04:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936278626] [2024-11-28 03:04:07,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:08,483 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-28 03:04:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936278626] [2024-11-28 03:04:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936278626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:04:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963623158] [2024-11-28 03:04:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:04:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:08,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:04:08,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:04:08,485 INFO L87 Difference]: Start difference. First operand 396 states and 481 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-28 03:04:12,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:16,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:17,437 INFO L93 Difference]: Finished difference Result 560 states and 654 transitions. [2024-11-28 03:04:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:04:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 60 [2024-11-28 03:04:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:17,440 INFO L225 Difference]: With dead ends: 560 [2024-11-28 03:04:17,440 INFO L226 Difference]: Without dead ends: 560 [2024-11-28 03:04:17,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 03:04:17,441 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 495 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:17,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 624 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-28 03:04:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-28 03:04:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 404. [2024-11-28 03:04:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 295 states have (on average 1.6271186440677967) internal successors, (480), 391 states have internal predecessors, (480), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 494 transitions. [2024-11-28 03:04:17,457 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 494 transitions. Word has length 60 [2024-11-28 03:04:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:17,457 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 494 transitions. [2024-11-28 03:04:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-28 03:04:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 494 transitions. [2024-11-28 03:04:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 03:04:17,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:17,458 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] [2024-11-28 03:04:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:04:17,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash -144657806, now seen corresponding path program 1 times [2024-11-28 03:04:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583718547] [2024-11-28 03:04:17,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:18,362 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-28 03:04:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583718547] [2024-11-28 03:04:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583718547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:04:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881357432] [2024-11-28 03:04:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:04:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:18,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:04:18,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:04:18,367 INFO L87 Difference]: Start difference. First operand 404 states and 494 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-28 03:04:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:18,655 INFO L93 Difference]: Finished difference Result 410 states and 494 transitions. [2024-11-28 03:04:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:04:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 60 [2024-11-28 03:04:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:18,657 INFO L225 Difference]: With dead ends: 410 [2024-11-28 03:04:18,657 INFO L226 Difference]: Without dead ends: 410 [2024-11-28 03:04:18,658 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-28 03:04:18,658 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 293 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:18,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1227 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:04:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-28 03:04:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2024-11-28 03:04:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 295 states have (on average 1.623728813559322) internal successors, (479), 391 states have internal predecessors, (479), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 493 transitions. [2024-11-28 03:04:18,673 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 493 transitions. Word has length 60 [2024-11-28 03:04:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 493 transitions. [2024-11-28 03:04:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-28 03:04:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 493 transitions. [2024-11-28 03:04:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:04:18,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:18,680 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-28 03:04:18,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:04:18,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1675571251, now seen corresponding path program 1 times [2024-11-28 03:04:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696160899] [2024-11-28 03:04:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:19,416 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-28 03:04:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696160899] [2024-11-28 03:04:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696160899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:19,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:04:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450947070] [2024-11-28 03:04:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:19,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:04:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:19,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:04:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:04:19,418 INFO L87 Difference]: Start difference. First operand 404 states and 493 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-28 03:04:23,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:23,970 INFO L93 Difference]: Finished difference Result 484 states and 566 transitions. [2024-11-28 03:04:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:04:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-28 03:04:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:23,972 INFO L225 Difference]: With dead ends: 484 [2024-11-28 03:04:23,973 INFO L226 Difference]: Without dead ends: 484 [2024-11-28 03:04:23,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 03:04:23,974 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 204 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:23,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 410 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 03:04:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-28 03:04:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 403. [2024-11-28 03:04:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 295 states have (on average 1.616949152542373) internal successors, (477), 390 states have internal predecessors, (477), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 491 transitions. [2024-11-28 03:04:23,988 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 491 transitions. Word has length 62 [2024-11-28 03:04:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 491 transitions. [2024-11-28 03:04:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-28 03:04:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 491 transitions. [2024-11-28 03:04:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:04:23,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:23,990 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-28 03:04:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:04:23,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:23,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1675571250, now seen corresponding path program 1 times [2024-11-28 03:04:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300983055] [2024-11-28 03:04:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:25,382 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-28 03:04:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300983055] [2024-11-28 03:04:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300983055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:25,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:25,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:04:25,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572072327] [2024-11-28 03:04:25,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:25,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:04:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:25,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:04:25,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:04:25,385 INFO L87 Difference]: Start difference. First operand 403 states and 491 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-28 03:04:29,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:33,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:37,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:41,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:43,098 INFO L93 Difference]: Finished difference Result 489 states and 566 transitions. [2024-11-28 03:04:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:04:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-28 03:04:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:43,101 INFO L225 Difference]: With dead ends: 489 [2024-11-28 03:04:43,101 INFO L226 Difference]: Without dead ends: 489 [2024-11-28 03:04:43,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:04:43,102 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 225 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:43,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 868 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 677 Invalid, 4 Unknown, 0 Unchecked, 17.6s Time] [2024-11-28 03:04:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-28 03:04:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 403. [2024-11-28 03:04:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 295 states have (on average 1.6135593220338984) internal successors, (476), 390 states have internal predecessors, (476), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 490 transitions. [2024-11-28 03:04:43,116 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 490 transitions. Word has length 62 [2024-11-28 03:04:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:43,117 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 490 transitions. [2024-11-28 03:04:43,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-28 03:04:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 490 transitions. [2024-11-28 03:04:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:04:43,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:43,118 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-28 03:04:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:04:43,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -832902662, now seen corresponding path program 1 times [2024-11-28 03:04:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825635818] [2024-11-28 03:04:43,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:44,368 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-28 03:04:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825635818] [2024-11-28 03:04:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825635818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:44,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:04:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884803451] [2024-11-28 03:04:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:04:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:44,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:04:44,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:04:44,371 INFO L87 Difference]: Start difference. First operand 403 states and 490 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-28 03:04:48,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:52,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:53,421 INFO L93 Difference]: Finished difference Result 402 states and 488 transitions. [2024-11-28 03:04:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:04:53,422 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-28 03:04:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:53,424 INFO L225 Difference]: With dead ends: 402 [2024-11-28 03:04:53,424 INFO L226 Difference]: Without dead ends: 402 [2024-11-28 03:04:53,424 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-28 03:04:53,424 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 243 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:53,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1085 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-28 03:04:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-28 03:04:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-28 03:04:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 295 states have (on average 1.6067796610169491) internal successors, (474), 389 states have internal predecessors, (474), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:04:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 488 transitions. [2024-11-28 03:04:53,442 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 488 transitions. Word has length 65 [2024-11-28 03:04:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:53,442 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 488 transitions. [2024-11-28 03:04:53,443 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-28 03:04:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 488 transitions. [2024-11-28 03:04:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:04:53,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:53,444 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-28 03:04:53,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:04:53,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:04:53,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -832902661, now seen corresponding path program 1 times [2024-11-28 03:04:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:53,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082142993] [2024-11-28 03:04:53,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:04:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:54,825 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-28 03:04:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082142993] [2024-11-28 03:04:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082142993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:04:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:04:54,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:04:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65069907] [2024-11-28 03:04:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:04:54,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:04:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:54,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:04:54,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:04:54,828 INFO L87 Difference]: Start difference. First operand 402 states and 488 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-28 03:04:58,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:02,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:10,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:11,814 INFO L93 Difference]: Finished difference Result 401 states and 486 transitions. [2024-11-28 03:05:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:05:11,814 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-28 03:05:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:11,815 INFO L225 Difference]: With dead ends: 401 [2024-11-28 03:05:11,815 INFO L226 Difference]: Without dead ends: 401 [2024-11-28 03:05:11,816 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-28 03:05:11,816 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 238 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:11,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1224 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-28 03:05:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-28 03:05:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-28 03:05:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 295 states have (on average 1.6) internal successors, (472), 388 states have internal predecessors, (472), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:05:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 486 transitions. [2024-11-28 03:05:11,825 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 486 transitions. Word has length 65 [2024-11-28 03:05:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 486 transitions. [2024-11-28 03:05:11,826 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-28 03:05:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 486 transitions. [2024-11-28 03:05:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:05:11,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:11,827 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-28 03:05:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:05:11,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:05:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1887502902, now seen corresponding path program 1 times [2024-11-28 03:05:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144049230] [2024-11-28 03:05:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:13,079 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-28 03:05:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144049230] [2024-11-28 03:05:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144049230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:13,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:13,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:05:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550126952] [2024-11-28 03:05:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:13,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:05:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:13,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:05:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:05:13,081 INFO L87 Difference]: Start difference. First operand 401 states and 486 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-28 03:05:17,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:21,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:25,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:29,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:33,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:37,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:41,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:42,788 INFO L93 Difference]: Finished difference Result 492 states and 575 transitions. [2024-11-28 03:05:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:05:42,789 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-28 03:05:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:42,790 INFO L225 Difference]: With dead ends: 492 [2024-11-28 03:05:42,790 INFO L226 Difference]: Without dead ends: 492 [2024-11-28 03:05:42,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:05:42,791 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 388 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:42,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1261 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 673 Invalid, 7 Unknown, 0 Unchecked, 29.5s Time] [2024-11-28 03:05:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-28 03:05:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 409. [2024-11-28 03:05:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 303 states have (on average 1.6006600660066006) internal successors, (485), 396 states have internal predecessors, (485), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:05:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 499 transitions. [2024-11-28 03:05:42,802 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 499 transitions. Word has length 70 [2024-11-28 03:05:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 499 transitions. [2024-11-28 03:05:42,802 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-28 03:05:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 499 transitions. [2024-11-28 03:05:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:05:42,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:42,803 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-28 03:05:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:05:42,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:05:42,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1887502903, now seen corresponding path program 1 times [2024-11-28 03:05:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703876500] [2024-11-28 03:05:42,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:44,350 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-28 03:05:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703876500] [2024-11-28 03:05:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703876500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:05:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913249376] [2024-11-28 03:05:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:05:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:05:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:05:44,352 INFO L87 Difference]: Start difference. First operand 409 states and 499 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-28 03:05:48,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:52,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:00,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:04,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:08,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:12,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:16,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:06:18,699 INFO L93 Difference]: Finished difference Result 490 states and 570 transitions. [2024-11-28 03:06:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:06:18,699 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-28 03:06:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:06:18,703 INFO L225 Difference]: With dead ends: 490 [2024-11-28 03:06:18,703 INFO L226 Difference]: Without dead ends: 490 [2024-11-28 03:06:18,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:06:18,705 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 386 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:06:18,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1367 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 890 Invalid, 8 Unknown, 0 Unchecked, 34.1s Time] [2024-11-28 03:06:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-28 03:06:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 409. [2024-11-28 03:06:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 303 states have (on average 1.5874587458745875) internal successors, (481), 396 states have internal predecessors, (481), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:06:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 495 transitions. [2024-11-28 03:06:18,717 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 495 transitions. Word has length 70 [2024-11-28 03:06:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:06:18,717 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 495 transitions. [2024-11-28 03:06:18,718 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-28 03:06:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 495 transitions. [2024-11-28 03:06:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:06:18,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:06:18,719 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-28 03:06:18,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:06:18,721 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:06:18,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:06:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1849934069, now seen corresponding path program 1 times [2024-11-28 03:06:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:06:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334933831] [2024-11-28 03:06:18,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:06:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:06:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:20,431 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-28 03:06:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:06:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334933831] [2024-11-28 03:06:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334933831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:06:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961938187] [2024-11-28 03:06:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:06:20,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:06:20,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:06:20,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:06:20,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:06:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:21,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:06:21,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:06:21,522 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-28 03:06:21,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:06:21,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:06:21,759 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-28 03:06:21,931 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-28 03:06:22,163 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:06:22,164 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-28 03:06:22,382 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:06:22,383 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-28 03:06:22,449 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-28 03:06:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-28 03:06:22,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:06:22,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6328 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_6328) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2024-11-28 03:06:22,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6328 (Array Int Int))) (= (select |c_#valid| (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_6328) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:06:22,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6328 (Array Int Int)) (v_ArrVal_6327 (Array Int Int))) (= (select |c_#valid| (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_#t~mem186#1.base| v_ArrVal_6327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_6328)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:06:27,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:06:27,025 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 106 treesize of output 71 [2024-11-28 03:06:27,033 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 2862 treesize of output 2230 [2024-11-28 03:06:27,072 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 228 treesize of output 180 [2024-11-28 03:06:27,080 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 180 treesize of output 156 [2024-11-28 03:06:27,091 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 95 treesize of output 59 [2024-11-28 03:06:31,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:06:31,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 176 treesize of output 876 [2024-11-28 03:07:20,269 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-28 03:07:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961938187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:07:20,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:07:20,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2024-11-28 03:07:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032274699] [2024-11-28 03:07:20,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:07:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:07:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:20,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:07:20,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=320, Unknown=22, NotChecked=120, Total=552 [2024-11-28 03:07:20,271 INFO L87 Difference]: Start difference. First operand 409 states and 495 transitions. Second operand has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 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-28 03:07:24,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:28,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:32,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:36,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:40,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:07:44,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:48,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:52,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:07:56,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:00,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:04,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:08,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:12,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:15,851 INFO L93 Difference]: Finished difference Result 489 states and 568 transitions. [2024-11-28 03:08:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:08:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 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-28 03:08:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:15,853 INFO L225 Difference]: With dead ends: 489 [2024-11-28 03:08:15,853 INFO L226 Difference]: Without dead ends: 489 [2024-11-28 03:08:15,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=120, Invalid=376, Unknown=22, NotChecked=132, Total=650 [2024-11-28 03:08:15,854 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 737 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 14 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1221 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:15,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2528 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1347 Invalid, 13 Unknown, 1221 Unchecked, 55.4s Time] [2024-11-28 03:08:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-28 03:08:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 408. [2024-11-28 03:08:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 303 states have (on average 1.5808580858085808) internal successors, (479), 395 states have internal predecessors, (479), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:08:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 493 transitions. [2024-11-28 03:08:15,863 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 493 transitions. Word has length 75 [2024-11-28 03:08:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:15,863 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 493 transitions. [2024-11-28 03:08:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 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-28 03:08:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 493 transitions. [2024-11-28 03:08:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:08:15,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:15,864 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-28 03:08:15,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:08:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:08:16,065 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:08:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1849934068, now seen corresponding path program 1 times [2024-11-28 03:08:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056855923] [2024-11-28 03:08:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:17,922 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-28 03:08:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056855923] [2024-11-28 03:08:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056855923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:08:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274534075] [2024-11-28 03:08:17,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:08:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:08:17,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:08:17,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:08:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:18,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 03:08:18,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:08:18,904 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-28 03:08:18,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:08:18,959 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-28 03:08:18,974 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-28 03:08:19,052 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-28 03:08:19,060 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 23 treesize of output 1 [2024-11-28 03:08:19,208 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-28 03:08:19,215 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-28 03:08:19,440 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:08:19,441 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-28 03:08:19,459 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-28 03:08:19,786 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:08:19,787 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-28 03:08:19,807 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 49 treesize of output 26 [2024-11-28 03:08:20,061 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-28 03:08:20,074 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 36 treesize of output 12 [2024-11-28 03:08:20,182 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-28 03:08:20,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:08:21,117 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 ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6953 (Array Int Int)) (v_ArrVal_6954 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6954))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 0) (forall ((v_ArrVal_6956 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6953) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_6956) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6953 (Array Int Int)) (v_ArrVal_6954 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6954))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0) (forall ((v_ArrVal_6955 (Array Int Int)) (v_ArrVal_6956 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6953))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_6956) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 03:08:21,207 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_6951 (Array Int Int)) (v_ArrVal_6953 (Array Int Int)) (v_ArrVal_6952 (Array Int Int)) (v_ArrVal_6954 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_6952))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_6951) .cse5 v_ArrVal_6954))) (or (forall ((v_ArrVal_6955 (Array Int Int)) (v_ArrVal_6956 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_6953))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_6956) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 0)))))) (forall ((v_ArrVal_6951 (Array Int Int)) (v_ArrVal_6953 (Array Int Int)) (v_ArrVal_6952 (Array Int Int)) (v_ArrVal_6954 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_6952))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_6951) .cse9 v_ArrVal_6954))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse6 0) (forall ((v_ArrVal_6956 (Array Int Int))) (< .cse6 (+ (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_6953) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_6956) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))))))))))) is different from false [2024-11-28 03:08:21,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:21,343 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 262 treesize of output 250 [2024-11-28 03:08:21,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:21,360 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 238 treesize of output 154 [2024-11-28 03:08:21,372 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 5703 treesize of output 4695 [2024-11-28 03:08:21,416 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 3205 treesize of output 3077 [2024-11-28 03:08:21,438 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-28 03:08:21,449 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-28 03:08:21,461 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-28 03:08:21,468 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 207 treesize of output 183 [2024-11-28 03:08:21,480 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 112 treesize of output 82 [2024-11-28 03:08:21,492 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 82 treesize of output 70 [2024-11-28 03:08:21,727 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:08:21,727 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 1 [2024-11-28 03:08:22,048 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:08:22,048 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-28 03:08:22,063 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-28 03:08:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274534075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:08:22,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:08:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-11-28 03:08:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655794712] [2024-11-28 03:08:22,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:08:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:08:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:22,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:08:22,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=801, Unknown=10, NotChecked=118, Total=1056 [2024-11-28 03:08:22,065 INFO L87 Difference]: Start difference. First operand 408 states and 493 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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-28 03:08:26,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:30,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:34,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:08:38,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:42,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:46,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:50,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:54,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:58,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:02,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:06,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:10,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:14,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:18,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:22,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:26,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:30,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:34,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:38,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:42,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:46,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:50,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:09:54,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:10:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:00,450 INFO L93 Difference]: Finished difference Result 509 states and 592 transitions. [2024-11-28 03:10:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:10:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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-28 03:10:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:00,452 INFO L225 Difference]: With dead ends: 509 [2024-11-28 03:10:00,452 INFO L226 Difference]: Without dead ends: 509 [2024-11-28 03:10:00,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=267, Invalid=1371, Unknown=10, NotChecked=158, Total=1806 [2024-11-28 03:10:00,454 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 810 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 18 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 97.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:00,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2787 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2060 Invalid, 49 Unknown, 837 Unchecked, 97.3s Time] [2024-11-28 03:10:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-28 03:10:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 428. [2024-11-28 03:10:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 415 states have internal predecessors, (503), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:10:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 517 transitions. [2024-11-28 03:10:00,465 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 517 transitions. Word has length 75 [2024-11-28 03:10:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:00,465 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 517 transitions. [2024-11-28 03:10:00,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 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-28 03:10:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 517 transitions. [2024-11-28 03:10:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-28 03:10:00,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:00,467 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:00,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:10:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:00,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:10:00,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1470507911, now seen corresponding path program 1 times [2024-11-28 03:10:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616736219] [2024-11-28 03:10:00,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:10:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616736219] [2024-11-28 03:10:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616736219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:10:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952935543] [2024-11-28 03:10:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:01,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:10:01,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:10:01,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:10:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:02,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:10:02,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:10:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:10:02,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:10:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:10:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952935543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:10:02,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:10:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-28 03:10:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595925459] [2024-11-28 03:10:02,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:10:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:10:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:10:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:10:02,364 INFO L87 Difference]: Start difference. First operand 428 states and 517 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-28 03:10:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:02,452 INFO L93 Difference]: Finished difference Result 457 states and 545 transitions. [2024-11-28 03:10:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:10:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 81 [2024-11-28 03:10:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:02,455 INFO L225 Difference]: With dead ends: 457 [2024-11-28 03:10:02,455 INFO L226 Difference]: Without dead ends: 457 [2024-11-28 03:10:02,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:10:02,457 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 18 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:02,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1274 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:10:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-28 03:10:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2024-11-28 03:10:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 347 states have (on average 1.5302593659942363) internal successors, (531), 439 states have internal predecessors, (531), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:10:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 545 transitions. [2024-11-28 03:10:02,467 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 545 transitions. Word has length 81 [2024-11-28 03:10:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:02,468 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 545 transitions. [2024-11-28 03:10:02,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-28 03:10:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 545 transitions. [2024-11-28 03:10:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 03:10:02,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:02,469 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:02,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:10:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:02,670 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:10:02,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1531426284, now seen corresponding path program 2 times [2024-11-28 03:10:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570630857] [2024-11-28 03:10:02,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:10:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:03,003 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:10:03,003 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:10:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:10:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570630857] [2024-11-28 03:10:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570630857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:10:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176003792] [2024-11-28 03:10:05,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:10:05,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:10:05,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:10:05,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:10:43,079 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:10:43,079 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:10:43,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 03:10:43,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:10:43,106 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-28 03:10:43,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:10:43,164 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-28 03:10:43,179 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-28 03:10:43,254 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-28 03:10:43,275 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-28 03:10:43,486 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-28 03:10:43,492 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-28 03:10:43,670 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:10:43,670 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-28 03:10:43,677 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-28 03:10:43,935 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:10:43,936 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-28 03:10:43,954 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-28 03:10:44,217 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:10:44,217 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-28 03:10:44,231 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-28 03:10:44,498 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:10:44,498 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-28 03:10:44,513 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-28 03:10:44,631 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-28 03:10:44,640 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-28 03:10:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:10:44,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:10:44,984 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_8247 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8248) |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~mem187#1.base| v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_8248 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2024-11-28 03:10:45,023 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_8247 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8248) |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_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_8248 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2024-11-28 03:10:45,052 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_8247 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_8248 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2)))))) is different from false [2024-11-28 03:10:45,075 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_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8246))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8245) .cse0 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8245) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))))) is different from false [2024-11-28 03:10:45,118 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_8246 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8245) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8246))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8245) .cse2 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-28 03:10:45,152 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_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8246))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8245) .cse1 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8245) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3)))))) is different from false [2024-11-28 03:10:45,175 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_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8244))) (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~mem187#1.base| v_ArrVal_8243) .cse0 v_ArrVal_8245) (select (select (store .cse1 .cse0 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_8248))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8244))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_8246))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8243) .cse3 v_ArrVal_8245) .cse4 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:10:45,212 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_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8244))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8243) .cse1 v_ArrVal_8245) (select (select (store .cse2 .cse1 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_8248))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8244))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8246))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8243) .cse4 v_ArrVal_8245) .cse5 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 03:10:45,256 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_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8244))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8246))) (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_8243) .cse1 v_ArrVal_8245) .cse2 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8243 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8244))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8243) .cse6 v_ArrVal_8245) (select (select (store .cse7 .cse6 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_8248))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3)))))) is different from false [2024-11-28 03:10:45,286 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_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8242))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8244))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8246))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8241) .cse0 v_ArrVal_8243) .cse1 v_ArrVal_8245) .cse2 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8242))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8244))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8241) .cse7 v_ArrVal_8243) .cse8 v_ArrVal_8245) (select (select (store .cse9 .cse8 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_8248))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))))) is different from false [2024-11-28 03:10:45,315 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 ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8242))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8244))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8246))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8241) .cse1 v_ArrVal_8243) .cse2 v_ArrVal_8245) .cse3 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8242))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8244))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8241) .cse8 v_ArrVal_8243) .cse9 v_ArrVal_8245) (select (select (store .cse10 .cse9 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8248))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3)))))) is different from false [2024-11-28 03:10:45,377 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|))) (and (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8239 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8238 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8239))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8242))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8244))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8238) .cse0 v_ArrVal_8241) .cse1 v_ArrVal_8243) .cse2 v_ArrVal_8245) (select (select (store .cse3 .cse2 v_ArrVal_8246) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8248))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (forall ((v_ArrVal_8246 (Array Int Int)) (v_ArrVal_8247 (Array Int Int)) (v_ArrVal_8244 (Array Int Int)) (v_ArrVal_8245 (Array Int Int)) (v_ArrVal_8239 (Array Int Int)) (v_ArrVal_8248 (Array Int Int)) (v_ArrVal_8238 (Array Int Int)) (v_ArrVal_8242 (Array Int Int)) (v_ArrVal_8243 (Array Int Int)) (v_ArrVal_8241 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8239))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_8242))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_8244))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_8246))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8238) .cse7 v_ArrVal_8241) .cse8 v_ArrVal_8243) .cse9 v_ArrVal_8245) .cse10 v_ArrVal_8248) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_8247) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-28 03:10:45,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:10:45,432 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 418 treesize of output 419 [2024-11-28 03:10:45,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:10:45,443 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 406 treesize of output 239 [2024-11-28 03:10:45,559 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 12511414 treesize of output 11116958 [2024-11-28 03:10:52,864 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 2686 DAG size of output: 310 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:53,101 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 42550220 treesize of output 42067364 [2024-11-28 03:10:58,216 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 2908 DAG size of output: 237 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:58,435 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 34936 treesize of output 30904 [2024-11-28 03:10:58,654 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 30904 treesize of output 30400 [2024-11-28 03:10:58,876 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 30400 treesize of output 27064 [2024-11-28 03:10:59,126 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 27064 treesize of output 23584 [2024-11-28 03:10:59,346 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 23584 treesize of output 22816 [2024-11-28 03:10:59,568 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 22816 treesize of output 20080 [2024-11-28 03:10:59,810 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 20080 treesize of output 19048 [2024-11-28 03:11:00,036 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 19048 treesize of output 17824 [2024-11-28 03:11:00,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 17824 treesize of output 17380 [2024-11-28 03:11:08,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:08,154 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 833 treesize of output 834 [2024-11-28 03:11:08,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:08,175 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 821 treesize of output 462 [2024-11-28 03:11:08,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:11:08,206 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 241058 treesize of output 167146 [2024-11-28 03:11:08,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:11:08,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:11:08,370 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 28 treesize of output 12 [2024-11-28 03:11:08,638 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:11:08,638 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-28 03:11:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 27 not checked. [2024-11-28 03:11:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176003792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:11:08,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:11:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 46 [2024-11-28 03:11:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780512026] [2024-11-28 03:11:08,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:11:08,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 03:11:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:08,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 03:11:08,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1052, Unknown=12, NotChecked=924, Total=2162 [2024-11-28 03:11:08,655 INFO L87 Difference]: Start difference. First operand 452 states and 545 transitions. Second operand has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 47 states have internal predecessors, (106), 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-28 03:11:12,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:16,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:20,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:24,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:28,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:32,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:36,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:40,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:44,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:48,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:52,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:11:56,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:00,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:04,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:08,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:12,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:16,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:20,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:12:24,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:28,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:33,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:37,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:41,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:45,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:49,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:53,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:57,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:13:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:04,830 INFO L93 Difference]: Finished difference Result 533 states and 618 transitions. [2024-11-28 03:13:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:13:04,831 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 47 states have internal predecessors, (106), 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 85 [2024-11-28 03:13:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:04,833 INFO L225 Difference]: With dead ends: 533 [2024-11-28 03:13:04,833 INFO L226 Difference]: Without dead ends: 533 [2024-11-28 03:13:04,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=344, Invalid=1854, Unknown=12, NotChecked=1212, Total=3422 [2024-11-28 03:13:04,835 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 417 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 12 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 7165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 5091 IncrementalHoareTripleChecker+Unchecked, 112.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:04,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 3207 Invalid, 7165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2035 Invalid, 27 Unknown, 5091 Unchecked, 112.9s Time] [2024-11-28 03:13:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-28 03:13:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 452. [2024-11-28 03:13:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 347 states have (on average 1.5244956772334295) internal successors, (529), 439 states have internal predecessors, (529), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:13:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 543 transitions. [2024-11-28 03:13:04,846 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 543 transitions. Word has length 85 [2024-11-28 03:13:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:04,846 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 543 transitions. [2024-11-28 03:13:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 47 states have internal predecessors, (106), 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-28 03:13:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 543 transitions. [2024-11-28 03:13:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 03:13:04,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:04,848 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-28 03:13:04,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:13:05,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:13:05,049 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2024-11-28 03:13:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 453678199, now seen corresponding path program 3 times [2024-11-28 03:13:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:05,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689563626] [2024-11-28 03:13:05,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:13:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:05,927 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 03:13:05,927 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:09,197 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-28 03:13:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689563626] [2024-11-28 03:13:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689563626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:13:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634728438] [2024-11-28 03:13:09,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:13:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:13:09,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:13:09,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:13:09,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74bdc119-fa83-4f56-9a66-c6d3ad7f8869/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:15:34,544 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 03:15:34,544 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:15:34,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 03:15:34,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:34,592 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-28 03:15:34,643 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-28 03:15:34,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:15:34,680 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-28 03:15:34,787 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 23 treesize of output 1 [2024-11-28 03:15:34,811 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-28 03:15:34,975 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-28 03:15:34,982 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-28 03:15:35,223 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:15:35,224 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-28 03:15:35,231 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-28 03:15:35,540 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:15:35,540 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-28 03:15:35,557 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-28 03:15:35,867 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:15:35,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:15:35,887 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-28 03:15:36,210 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:15:36,210 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-28 03:15:36,226 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-28 03:15:36,596 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:15:36,597 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-28 03:15:36,608 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 49 treesize of output 26 [2024-11-28 03:15:37,017 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-28 03:15:37,030 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 36 treesize of output 12 [2024-11-28 03:15:37,139 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-28 03:15:37,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:38,128 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_8915 (Array Int Int)) (v_ArrVal_8916 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8915))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 1) 0) (forall ((v_ArrVal_8917 (Array Int Int))) (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))))))) (forall ((v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8916 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8915))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 1) 0) (forall ((v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8916))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse3 .cse4 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))))))) is different from false [2024-11-28 03:15:38,200 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 ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8916 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_8915))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_8917 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 1) 0))))) (forall ((v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8916 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_8915))) (or (forall ((v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_8916))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse4 .cse5 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) 0))))))) is different from false [2024-11-28 03:15:38,304 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_8915))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) 0) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_8916))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse0 .cse2 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_8915))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse5 2) 0) (< .cse5 (+ 2 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 03:15:38,363 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|))) (and (forall ((v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8914))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8913) .cse3 v_ArrVal_8915))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse0) 0))))))) (forall ((v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8914))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8913) .cse9 v_ArrVal_8915))) (or (let ((.cse7 (store .cse8 .cse9 v_ArrVal_8916))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse5 .cse6 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0)))))))) is different from false [2024-11-28 03:15:38,447 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse0 .cse2 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8914))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8913) .cse10 v_ArrVal_8915))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse7 2) 0) (< .cse7 (+ 2 (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 03:15:38,536 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_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8914))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8913) .cse3 v_ArrVal_8915))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 3) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))) (forall ((v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8914))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8913) .cse10 v_ArrVal_8915))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) 0) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_8916))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse6 .cse7 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) is different from false [2024-11-28 03:15:38,596 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_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8912))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8911) .cse6 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8912))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_8914))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem187#1.base| v_ArrVal_8911) .cse12 v_ArrVal_8913) .cse11 v_ArrVal_8915))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< .cse8 (+ (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 .cse8) 0))))))))))) is different from false [2024-11-28 03:15:38,767 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8912))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8911) .cse7 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse0 .cse1 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))))) (forall ((v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8912))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_8914))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8911) .cse13 v_ArrVal_8913) .cse12 v_ArrVal_8915))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse9 (+ 2 (select (select (store .cse10 (select (select (store .cse11 .cse12 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 .cse9) 0)))))))))))) is different from false [2024-11-28 03:15:38,873 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8912))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8911) .cse7 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ 3 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))))) (forall ((v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8912))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_8914))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8911) .cse13 v_ArrVal_8913) .cse12 v_ArrVal_8915))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse9 (+ 2 (select (select (store .cse10 (select (select (store .cse11 .cse12 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ 3 .cse9) 0)))))))))))) is different from false [2024-11-28 03:15:39,241 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_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8909))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_8912))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8910) .cse6 v_ArrVal_8911) .cse7 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (< (+ 3 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8909))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_8912))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_8914))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem186#1.base| v_ArrVal_8910) .cse14 v_ArrVal_8911) .cse15 v_ArrVal_8913) .cse13 v_ArrVal_8915))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< .cse10 (+ (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)) (< (+ 3 .cse10) 0))))))))))))) is different from false [2024-11-28 03:15:43,324 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8909))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8912))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_8914))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8910) .cse7 v_ArrVal_8911) .cse8 v_ArrVal_8913) .cse5 v_ArrVal_8915))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_8916))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_8909))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_8912))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_8914))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_8910) .cse15 v_ArrVal_8911) .cse16 v_ArrVal_8913) .cse14 v_ArrVal_8915))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ .cse11 3) 0) (< .cse11 (+ 2 (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 03:15:47,510 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|))) (and (forall ((v_ArrVal_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8907 (Array Int Int)) (v_ArrVal_8908 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8907))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_8909))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_8912))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_8914))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8908) .cse5 v_ArrVal_8910) .cse6 v_ArrVal_8911) .cse7 v_ArrVal_8913) .cse3 v_ArrVal_8915))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_8916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ .cse0 3) 0))))))))))))) (forall ((v_ArrVal_8909 (Array Int Int)) (v_ArrVal_8910 (Array Int Int)) (v_ArrVal_8911 (Array Int Int)) (v_ArrVal_8914 (Array Int Int)) (v_ArrVal_8915 (Array Int Int)) (v_ArrVal_8912 (Array Int Int)) (v_ArrVal_8913 (Array Int Int)) (v_ArrVal_8907 (Array Int Int)) (v_ArrVal_8918 (Array Int Int)) (v_ArrVal_8908 (Array Int Int)) (v_ArrVal_8916 (Array Int Int)) (v_ArrVal_8917 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8907))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_8909))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_8912))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse19 .cse18 v_ArrVal_8914))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_8908) .cse16 v_ArrVal_8910) .cse17 v_ArrVal_8911) .cse18 v_ArrVal_8913) .cse15 v_ArrVal_8915))) (or (< (+ (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) 0) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_8916))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse11 .cse12 v_ArrVal_8917) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_8918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))))))) is different from false [2024-11-28 03:15:47,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:15:47,632 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 1666 treesize of output 1642 [2024-11-28 03:15:47,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:15:47,648 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 1630 treesize of output 910 [2024-11-28 03:15:48,001 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 607199125 treesize of output 545471709 [2024-11-28 03:16:17,075 WARN L286 SmtUtils]: Spent 29.03s on a formula simplification. DAG size of input: 14151 DAG size of output: 627 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:20,490 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 486376149671 treesize of output 481298849423 [2024-11-28 03:16:40,722 WARN L286 SmtUtils]: Spent 20.17s on a formula simplification. DAG size of input: 25031 DAG size of output: 398 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:40,844 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 23755 treesize of output 23179 [2024-11-28 03:16:41,011 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 20505 treesize of output 18489 [2024-11-28 03:16:41,130 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 21163 treesize of output 19171 [2024-11-28 03:16:41,249 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 19171 treesize of output 17875 [2024-11-28 03:16:41,368 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 17875 treesize of output 15403 [2024-11-28 03:16:41,487 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 15403 treesize of output 15067 [2024-11-28 03:16:41,605 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 15067 treesize of output 12379 [2024-11-28 03:16:41,738 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 12379 treesize of output 11035 [2024-11-28 03:16:41,875 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 11035 treesize of output 10963 [2024-11-28 03:16:42,028 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 9585 treesize of output 9105 [2024-11-28 03:16:42,175 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 10483 treesize of output 10363 [2024-11-28 03:16:47,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:16:47,283 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 2084 treesize of output 2072 [2024-11-28 03:16:47,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:16:47,300 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 2060 treesize of output 1136 [2024-11-28 03:16:47,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:16:47,873 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 91182975 treesize of output 75110551 [2024-11-28 03:16:54,753 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 6329 DAG size of output: 156 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:54,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:16:54,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:16:54,761 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 41 treesize of output 17 [2024-11-28 03:16:55,043 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:16:55,044 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-28 03:16:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 190 trivial. 41 not checked. [2024-11-28 03:16:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634728438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:16:55,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:16:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 22] total 53 [2024-11-28 03:16:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528056548] [2024-11-28 03:16:55,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:16:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-28 03:16:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:55,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-28 03:16:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1497, Unknown=12, NotChecked=1092, Total=2862 [2024-11-28 03:16:55,060 INFO L87 Difference]: Start difference. First operand 452 states and 543 transitions. Second operand has 54 states, 53 states have (on average 2.2830188679245285) internal successors, (121), 54 states have internal predecessors, (121), 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-28 03:16:59,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:17:03,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:17:07,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:17:11,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:17:15,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []