./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/realpath-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/realpath-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC --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 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:01:24,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:01:24,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-24 01:01:24,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:01:24,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:01:24,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:01:24,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:01:24,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:01:24,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:01:24,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:01:24,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:01:24,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:01:24,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:01:24,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:01:24,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:01:24,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:01:24,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:01:24,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:01:24,335 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 01:01:24,335 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:01:24,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:01:24,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:01:24,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:24,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:24,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:24,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:24,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:01:24,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:24,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:01:24,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:01:24,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:01:24,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:01:24,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:01:24,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:01:24,339 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_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC 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 -> 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 [2024-11-24 01:01:24,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:01:24,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:01:24,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:01:24,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:01:24,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:01:24,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2024-11-24 01:01:27,922 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/data/6c4eec182/e51fb6cb1b1f433f9215427896213471/FLAG265943f2a [2024-11-24 01:01:28,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:01:28,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2024-11-24 01:01:28,469 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/data/6c4eec182/e51fb6cb1b1f433f9215427896213471/FLAG265943f2a [2024-11-24 01:01:28,494 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/data/6c4eec182/e51fb6cb1b1f433f9215427896213471 [2024-11-24 01:01:28,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:01:28,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:01:28,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:28,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:01:28,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:01:28,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:28" (1/1) ... [2024-11-24 01:01:28,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b95ffe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:28, skipping insertion in model container [2024-11-24 01:01:28,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:28" (1/1) ... [2024-11-24 01:01:28,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:01:29,836 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-24 01:01:29,839 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-24 01:01:29,843 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-24 01:01:29,846 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-24 01:01:29,848 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-24 01:01:29,849 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-24 01:01:29,849 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-24 01:01:29,851 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-24 01:01:29,851 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-24 01:01:29,853 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-24 01:01:29,860 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-24 01:01:29,863 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-24 01:01:29,873 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-24 01:01:29,874 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-24 01:01:29,878 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-24 01:01:29,880 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-24 01:01:29,880 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-24 01:01:29,882 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-24 01:01:29,886 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-24 01:01:29,891 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-24 01:01:29,903 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-24 01:01:29,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:29,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:01:30,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:30,348 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-24 01:01:30,357 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:01:30,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30 WrapperNode [2024-11-24 01:01:30,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:30,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:30,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:01:30,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:01:30,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,462 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 837 [2024-11-24 01:01:30,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:30,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:01:30,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:01:30,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:01:30,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,496 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-24 01:01:30,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:01:30,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:01:30,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:01:30,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:01:30,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (1/1) ... [2024-11-24 01:01:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:30,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:30,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:01:30,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:01:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:01:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-24 01:01:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2024-11-24 01:01:30,673 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2024-11-24 01:01:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:01:30,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:01:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-24 01:01:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-24 01:01:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-24 01:01:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-24 01:01:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:01:30,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:01:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:01:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-24 01:01:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 01:01:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 01:01:31,118 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:01:31,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:01:33,641 INFO L? ?]: Removed 374 outVars from TransFormulas that were not future-live. [2024-11-24 01:01:33,642 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:01:33,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:01:33,666 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-24 01:01:33,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:33 BoogieIcfgContainer [2024-11-24 01:01:33,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:01:33,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:01:33,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:01:33,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:01:33,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:01:28" (1/3) ... [2024-11-24 01:01:33,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd69354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:33, skipping insertion in model container [2024-11-24 01:01:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:30" (2/3) ... [2024-11-24 01:01:33,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd69354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:33, skipping insertion in model container [2024-11-24 01:01:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:33" (3/3) ... [2024-11-24 01:01:33,680 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-1.i [2024-11-24 01:01:33,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:01:33,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-1.i that has 4 procedures, 317 locations, 1 initial locations, 13 loop locations, and 125 error locations. [2024-11-24 01:01:33,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:01:33,781 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;@58f42cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:01:33,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2024-11-24 01:01:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 181 states have (on average 1.9281767955801106) internal successors, (349), 306 states have internal predecessors, (349), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-24 01:01:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-24 01:01:33,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:33,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-24 01:01:33,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:33,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 327757, now seen corresponding path program 1 times [2024-11-24 01:01:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47615849] [2024-11-24 01:01:33,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:35,002 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-24 01:01:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47615849] [2024-11-24 01:01:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47615849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:35,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:35,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:01:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856279458] [2024-11-24 01:01:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:35,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:35,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:35,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:35,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:35,055 INFO L87 Difference]: Start difference. First operand has 317 states, 181 states have (on average 1.9281767955801106) internal successors, (349), 306 states have internal predecessors, (349), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:01:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:35,971 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2024-11-24 01:01:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:35,973 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-24 01:01:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:35,983 INFO L225 Difference]: With dead ends: 211 [2024-11-24 01:01:35,983 INFO L226 Difference]: Without dead ends: 209 [2024-11-24 01:01:35,985 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-24 01:01:35,988 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 108 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:35,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 180 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 01:01:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-24 01:01:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2024-11-24 01:01:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 147 states have internal predecessors, (158), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:01:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2024-11-24 01:01:36,056 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2024-11-24 01:01:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:36,056 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2024-11-24 01:01:36,057 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-24 01:01:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2024-11-24 01:01:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-24 01:01:36,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:36,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-24 01:01:36,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:01:36,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:36,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 327758, now seen corresponding path program 1 times [2024-11-24 01:01:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133005682] [2024-11-24 01:01:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:36,719 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-24 01:01:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:36,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133005682] [2024-11-24 01:01:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133005682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:36,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:01:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586484557] [2024-11-24 01:01:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:36,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:36,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:36,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:36,722 INFO L87 Difference]: Start difference. First operand 153 states and 164 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-24 01:01:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:38,021 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2024-11-24 01:01:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:38,022 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-24 01:01:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:38,023 INFO L225 Difference]: With dead ends: 152 [2024-11-24 01:01:38,023 INFO L226 Difference]: Without dead ends: 152 [2024-11-24 01:01:38,023 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-24 01:01:38,024 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:38,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 256 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:01:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-24 01:01:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-24 01:01:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 90 states have (on average 1.7444444444444445) internal successors, (157), 146 states have internal predecessors, (157), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:01:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2024-11-24 01:01:38,042 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 3 [2024-11-24 01:01:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:38,042 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2024-11-24 01:01:38,042 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-24 01:01:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2024-11-24 01:01:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-24 01:01:38,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:38,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:38,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:01:38,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2051264149, now seen corresponding path program 1 times [2024-11-24 01:01:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:38,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753184376] [2024-11-24 01:01:38,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:38,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:38,744 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-24 01:01:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753184376] [2024-11-24 01:01:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753184376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546580177] [2024-11-24 01:01:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:01:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:38,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:01:38,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:01:38,747 INFO L87 Difference]: Start difference. First operand 152 states and 163 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-24 01:01:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:39,730 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2024-11-24 01:01:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:01:39,730 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-24 01:01:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:39,731 INFO L225 Difference]: With dead ends: 156 [2024-11-24 01:01:39,732 INFO L226 Difference]: Without dead ends: 156 [2024-11-24 01:01:39,732 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-24 01:01:39,733 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 13 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:39,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 257 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:01:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-24 01:01:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-24 01:01:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:01:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2024-11-24 01:01:39,751 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 7 [2024-11-24 01:01:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2024-11-24 01:01:39,752 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-24 01:01:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-11-24 01:01:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-24 01:01:39,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:39,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:01:39,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 5930638, now seen corresponding path program 1 times [2024-11-24 01:01:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386881788] [2024-11-24 01:01:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:40,610 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-24 01:01:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386881788] [2024-11-24 01:01:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386881788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:01:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160247140] [2024-11-24 01:01:40,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:40,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:01:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:40,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:01:40,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:01:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:41,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 01:01:41,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:41,361 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-24 01:01:41,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:01:41,570 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-24 01:01:41,604 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-24 01:01:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160247140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:01:41,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:01:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-24 01:01:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190193780] [2024-11-24 01:01:41,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:01:41,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 01:01:41,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:41,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 01:01:41,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:01:41,610 INFO L87 Difference]: Start difference. First operand 155 states and 166 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-24 01:01:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:44,408 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2024-11-24 01:01:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:01:44,409 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-24 01:01:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:44,410 INFO L225 Difference]: With dead ends: 160 [2024-11-24 01:01:44,411 INFO L226 Difference]: Without dead ends: 160 [2024-11-24 01:01:44,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:01:44,412 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 271 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:44,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 480 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-24 01:01:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-24 01:01:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-24 01:01:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 154 states have internal predecessors, (165), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:01:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2024-11-24 01:01:44,433 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 11 [2024-11-24 01:01:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2024-11-24 01:01:44,433 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-24 01:01:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2024-11-24 01:01:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-24 01:01:44,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:44,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:44,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:01:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-24 01:01:44,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1237203329, now seen corresponding path program 1 times [2024-11-24 01:01:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234485179] [2024-11-24 01:01:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:45,215 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-24 01:01:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234485179] [2024-11-24 01:01:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234485179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:01:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89407543] [2024-11-24 01:01:45,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:01:45,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:45,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:01:45,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:01:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:45,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 01:01:45,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:45,865 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-24 01:01:45,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:01:45,982 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-24 01:01:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89407543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:01:45,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:01:45,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-24 01:01:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052756054] [2024-11-24 01:01:45,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:01:45,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 01:01:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:45,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 01:01:45,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:01:45,984 INFO L87 Difference]: Start difference. First operand 160 states and 171 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-24 01:01:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:46,093 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2024-11-24 01:01:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:01:46,094 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-24 01:01:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:46,095 INFO L225 Difference]: With dead ends: 180 [2024-11-24 01:01:46,095 INFO L226 Difference]: Without dead ends: 180 [2024-11-24 01:01:46,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:01:46,096 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 6 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:46,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 937 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:01:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-24 01:01:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-24 01:01:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.5546218487394958) internal successors, (185), 174 states have internal predecessors, (185), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 01:01:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2024-11-24 01:01:46,103 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 19 [2024-11-24 01:01:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:46,103 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2024-11-24 01:01:46,103 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-24 01:01:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2024-11-24 01:01:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-24 01:01:46,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:46,104 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:46,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:01:46,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:01:46,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1009604830, now seen corresponding path program 2 times [2024-11-24 01:01:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507242110] [2024-11-24 01:01:46,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:01:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:46,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 01:01:46,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:01:46,883 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-24 01:01:46,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507242110] [2024-11-24 01:01:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507242110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:46,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:46,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:01:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529764556] [2024-11-24 01:01:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:46,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:01:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:46,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:01:46,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:01:46,884 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-24 01:01:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:47,139 INFO L93 Difference]: Finished difference Result 245 states and 264 transitions. [2024-11-24 01:01:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:47,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-24 01:01:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:47,141 INFO L225 Difference]: With dead ends: 245 [2024-11-24 01:01:47,141 INFO L226 Difference]: Without dead ends: 245 [2024-11-24 01:01:47,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:01:47,142 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 219 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:47,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 183 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:01:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-24 01:01:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 188. [2024-11-24 01:01:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 126 states have (on average 1.5396825396825398) internal successors, (194), 181 states have internal predecessors, (194), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2024-11-24 01:01:47,154 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 39 [2024-11-24 01:01:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:47,158 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2024-11-24 01:01:47,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-24 01:01:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2024-11-24 01:01:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-24 01:01:47,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:47,159 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:47,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:01:47,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:47,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1009604831, now seen corresponding path program 1 times [2024-11-24 01:01:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745210158] [2024-11-24 01:01:47,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:48,056 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-24 01:01:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745210158] [2024-11-24 01:01:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745210158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:01:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894831781] [2024-11-24 01:01:48,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:01:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:48,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:01:48,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:01:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:48,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-24 01:01:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:48,755 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-24 01:01:48,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:01:48,935 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-24 01:01:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894831781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:01:48,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:01:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-24 01:01:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12089045] [2024-11-24 01:01:48,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:01:48,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:01:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:48,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:01:48,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:01:48,938 INFO L87 Difference]: Start difference. First operand 188 states and 202 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-24 01:01:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:49,024 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2024-11-24 01:01:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:01:49,024 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-24 01:01:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:49,025 INFO L225 Difference]: With dead ends: 196 [2024-11-24 01:01:49,025 INFO L226 Difference]: Without dead ends: 196 [2024-11-24 01:01:49,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:01:49,026 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:49,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 473 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:01:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-24 01:01:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-24 01:01:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.507462686567164) internal successors, (202), 189 states have internal predecessors, (202), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2024-11-24 01:01:49,044 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 39 [2024-11-24 01:01:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2024-11-24 01:01:49,044 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-24 01:01:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2024-11-24 01:01:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-24 01:01:49,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:49,045 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:49,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-24 01:01:49,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:01:49,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:49,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1434831953, now seen corresponding path program 2 times [2024-11-24 01:01:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318156881] [2024-11-24 01:01:49,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:01:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:49,431 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 01:01:49,432 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:01:49,832 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-24 01:01:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318156881] [2024-11-24 01:01:49,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318156881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:49,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:49,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938594287] [2024-11-24 01:01:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:49,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:01:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:49,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:01:49,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:01:49,835 INFO L87 Difference]: Start difference. First operand 196 states and 210 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-24 01:01:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:51,220 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2024-11-24 01:01:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:01:51,220 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-24 01:01:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:51,224 INFO L225 Difference]: With dead ends: 297 [2024-11-24 01:01:51,224 INFO L226 Difference]: Without dead ends: 297 [2024-11-24 01:01:51,224 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-24 01:01:51,225 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 460 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:51,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 199 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:01:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-24 01:01:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 195. [2024-11-24 01:01:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.5) internal successors, (201), 188 states have internal predecessors, (201), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 209 transitions. [2024-11-24 01:01:51,236 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 209 transitions. Word has length 47 [2024-11-24 01:01:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:51,236 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 209 transitions. [2024-11-24 01:01:51,236 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-24 01:01:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 209 transitions. [2024-11-24 01:01:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-24 01:01:51,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:51,240 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-24 01:01:51,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:01:51,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1792802158, now seen corresponding path program 1 times [2024-11-24 01:01:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288974004] [2024-11-24 01:01:51,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:52,165 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-24 01:01:52,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288974004] [2024-11-24 01:01:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288974004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:01:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769574620] [2024-11-24 01:01:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:52,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:52,169 INFO L87 Difference]: Start difference. First operand 195 states and 209 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-24 01:01:53,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:53,435 INFO L93 Difference]: Finished difference Result 241 states and 259 transitions. [2024-11-24 01:01:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:53,436 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-24 01:01:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:53,438 INFO L225 Difference]: With dead ends: 241 [2024-11-24 01:01:53,440 INFO L226 Difference]: Without dead ends: 241 [2024-11-24 01:01:53,440 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-24 01:01:53,441 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 86 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:53,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 191 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:01:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-24 01:01:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 190. [2024-11-24 01:01:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 134 states have (on average 1.462686567164179) internal successors, (196), 183 states have internal predecessors, (196), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-24 01:01:53,454 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 55 [2024-11-24 01:01:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:53,455 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-24 01:01:53,455 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-24 01:01:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-24 01:01:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-24 01:01:53,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:53,459 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-24 01:01:53,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:01:53,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:53,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1792802159, now seen corresponding path program 1 times [2024-11-24 01:01:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651665523] [2024-11-24 01:01:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:54,802 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-24 01:01:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651665523] [2024-11-24 01:01:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651665523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:01:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293468505] [2024-11-24 01:01:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:01:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:54,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:01:54,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:01:54,803 INFO L87 Difference]: Start difference. First operand 190 states and 204 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-24 01:01:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:56,065 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2024-11-24 01:01:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:01:56,066 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-24 01:01:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:56,068 INFO L225 Difference]: With dead ends: 244 [2024-11-24 01:01:56,068 INFO L226 Difference]: Without dead ends: 244 [2024-11-24 01:01:56,069 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-24 01:01:56,069 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 157 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:56,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 527 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:01:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-24 01:01:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2024-11-24 01:01:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 134 states have (on average 1.455223880597015) internal successors, (195), 182 states have internal predecessors, (195), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2024-11-24 01:01:56,078 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 55 [2024-11-24 01:01:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2024-11-24 01:01:56,079 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-24 01:01:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2024-11-24 01:01:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-24 01:01:56,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:56,080 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-24 01:01:56,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:01:56,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2033351222, now seen corresponding path program 1 times [2024-11-24 01:01:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956709221] [2024-11-24 01:01:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:56,962 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-24 01:01:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956709221] [2024-11-24 01:01:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956709221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:01:56,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217727818] [2024-11-24 01:01:56,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:01:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:56,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:01:56,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:01:56,966 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:01:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:57,423 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2024-11-24 01:01:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:01:57,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-24 01:01:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:57,425 INFO L225 Difference]: With dead ends: 260 [2024-11-24 01:01:57,425 INFO L226 Difference]: Without dead ends: 260 [2024-11-24 01:01:57,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-24 01:01:57,426 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 287 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 285 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:01:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-24 01:01:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 203. [2024-11-24 01:01:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 149 states have (on average 1.4563758389261745) internal successors, (217), 196 states have internal predecessors, (217), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2024-11-24 01:01:57,441 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 59 [2024-11-24 01:01:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:57,442 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2024-11-24 01:01:57,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:01:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2024-11-24 01:01:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-24 01:01:57,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:57,443 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-24 01:01:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:01:57,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2033354519, now seen corresponding path program 1 times [2024-11-24 01:01:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327960135] [2024-11-24 01:01:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:57,894 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-24 01:01:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327960135] [2024-11-24 01:01:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327960135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:57,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:57,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794110625] [2024-11-24 01:01:57,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:57,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:01:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:57,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:01:57,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:01:57,896 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:01:58,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:59,926 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2024-11-24 01:01:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:01:59,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-24 01:01:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:59,928 INFO L225 Difference]: With dead ends: 249 [2024-11-24 01:01:59,928 INFO L226 Difference]: Without dead ends: 249 [2024-11-24 01:01:59,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:01:59,929 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 149 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:59,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 236 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-24 01:01:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-24 01:01:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 200. [2024-11-24 01:01:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.429530201342282) internal successors, (213), 193 states have internal predecessors, (213), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:01:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2024-11-24 01:01:59,939 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 59 [2024-11-24 01:01:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:59,939 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2024-11-24 01:01:59,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:01:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2024-11-24 01:01:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-24 01:01:59,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:59,941 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-24 01:01:59,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:01:59,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:01:59,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2033354520, now seen corresponding path program 1 times [2024-11-24 01:01:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:59,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411749363] [2024-11-24 01:01:59,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:00,573 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-24 01:02:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:00,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411749363] [2024-11-24 01:02:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411749363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:02:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140691549] [2024-11-24 01:02:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:00,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:02:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:00,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:02:00,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:02:00,575 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:02:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:00,716 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2024-11-24 01:02:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:02:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-24 01:02:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:00,718 INFO L225 Difference]: With dead ends: 206 [2024-11-24 01:02:00,719 INFO L226 Difference]: Without dead ends: 206 [2024-11-24 01:02:00,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:02:00,720 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 142 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:00,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 517 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:02:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-24 01:02:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2024-11-24 01:02:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.4228187919463087) internal successors, (212), 193 states have internal predecessors, (212), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2024-11-24 01:02:00,727 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 59 [2024-11-24 01:02:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:00,728 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2024-11-24 01:02:00,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 01:02:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2024-11-24 01:02:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-24 01:02:00,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:00,729 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-24 01:02:00,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:02:00,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:00,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash -652202164, now seen corresponding path program 1 times [2024-11-24 01:02:00,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:00,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251134117] [2024-11-24 01:02:00,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:01,304 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-24 01:02:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:01,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251134117] [2024-11-24 01:02:01,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251134117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:02:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252640326] [2024-11-24 01:02:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:01,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:02:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:01,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:02:01,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:02:01,307 INFO L87 Difference]: Start difference. First operand 200 states and 220 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-24 01:02:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:02,294 INFO L93 Difference]: Finished difference Result 238 states and 264 transitions. [2024-11-24 01:02:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:02:02,294 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-24 01:02:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:02,295 INFO L225 Difference]: With dead ends: 238 [2024-11-24 01:02:02,296 INFO L226 Difference]: Without dead ends: 238 [2024-11-24 01:02:02,296 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-24 01:02:02,296 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 75 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:02,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 187 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:02:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-24 01:02:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2024-11-24 01:02:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 198 states have internal predecessors, (220), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2024-11-24 01:02:02,305 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 62 [2024-11-24 01:02:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:02,305 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2024-11-24 01:02:02,305 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-24 01:02:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2024-11-24 01:02:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-24 01:02:02,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:02,306 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-24 01:02:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:02:02,307 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -652202163, now seen corresponding path program 1 times [2024-11-24 01:02:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447131941] [2024-11-24 01:02:02,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:03,755 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-24 01:02:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:03,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447131941] [2024-11-24 01:02:03,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447131941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 01:02:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288563371] [2024-11-24 01:02:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:03,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:02:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:03,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:02:03,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:02:03,757 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-24 01:02:05,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:07,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:08,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:11,733 INFO L93 Difference]: Finished difference Result 288 states and 318 transitions. [2024-11-24 01:02:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:02:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-24 01:02:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:11,736 INFO L225 Difference]: With dead ends: 288 [2024-11-24 01:02:11,736 INFO L226 Difference]: Without dead ends: 288 [2024-11-24 01:02:11,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-24 01:02:11,737 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 201 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 628 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-24 01:02:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-24 01:02:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 214. [2024-11-24 01:02:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 164 states have (on average 1.4146341463414633) internal successors, (232), 207 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2024-11-24 01:02:11,750 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 62 [2024-11-24 01:02:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:11,751 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2024-11-24 01:02:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-24 01:02:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2024-11-24 01:02:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-24 01:02:11,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:11,752 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-24 01:02:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:02:11,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 677702140, now seen corresponding path program 1 times [2024-11-24 01:02:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685850407] [2024-11-24 01:02:11,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:12,595 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-24 01:02:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685850407] [2024-11-24 01:02:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685850407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:02:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609198030] [2024-11-24 01:02:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:02:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:12,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:02:12,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:02:12,597 INFO L87 Difference]: Start difference. First operand 214 states and 240 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-24 01:02:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:14,765 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2024-11-24 01:02:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:02:14,765 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-24 01:02:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:14,767 INFO L225 Difference]: With dead ends: 213 [2024-11-24 01:02:14,767 INFO L226 Difference]: Without dead ends: 213 [2024-11-24 01:02:14,767 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-24 01:02:14,768 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 90 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:14,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 386 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 01:02:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-24 01:02:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-24 01:02:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.4024390243902438) internal successors, (230), 206 states have internal predecessors, (230), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2024-11-24 01:02:14,776 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 65 [2024-11-24 01:02:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:14,776 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2024-11-24 01:02:14,776 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-24 01:02:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2024-11-24 01:02:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-24 01:02:14,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:14,777 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-24 01:02:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:02:14,778 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 677702141, now seen corresponding path program 1 times [2024-11-24 01:02:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:14,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909905952] [2024-11-24 01:02:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:16,156 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-24 01:02:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909905952] [2024-11-24 01:02:16,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909905952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:16,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:16,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:02:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030179418] [2024-11-24 01:02:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:16,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:02:16,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:16,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:02:16,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:02:16,158 INFO L87 Difference]: Start difference. First operand 213 states and 238 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-24 01:02:17,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:18,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:18,793 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2024-11-24 01:02:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:02:18,794 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-24 01:02:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:18,795 INFO L225 Difference]: With dead ends: 212 [2024-11-24 01:02:18,795 INFO L226 Difference]: Without dead ends: 212 [2024-11-24 01:02:18,796 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-24 01:02:18,796 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:18,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 405 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-24 01:02:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-24 01:02:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-24 01:02:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 164 states have (on average 1.3902439024390243) internal successors, (228), 205 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2024-11-24 01:02:18,803 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 65 [2024-11-24 01:02:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2024-11-24 01:02:18,804 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-24 01:02:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2024-11-24 01:02:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-24 01:02:18,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:18,805 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-24 01:02:18,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 01:02:18,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -802208971, now seen corresponding path program 1 times [2024-11-24 01:02:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143013883] [2024-11-24 01:02:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:20,045 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-24 01:02:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143013883] [2024-11-24 01:02:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143013883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:02:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342785030] [2024-11-24 01:02:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:20,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:02:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:02:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:02:20,049 INFO L87 Difference]: Start difference. First operand 212 states and 236 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-24 01:02:22,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:25,178 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2024-11-24 01:02:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:02:25,179 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-24 01:02:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:25,181 INFO L225 Difference]: With dead ends: 262 [2024-11-24 01:02:25,181 INFO L226 Difference]: Without dead ends: 262 [2024-11-24 01:02:25,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-24 01:02:25,182 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 228 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:25,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 658 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-24 01:02:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-24 01:02:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 220. [2024-11-24 01:02:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 172 states have (on average 1.4011627906976745) internal successors, (241), 213 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2024-11-24 01:02:25,191 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 70 [2024-11-24 01:02:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:25,191 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2024-11-24 01:02:25,191 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-24 01:02:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2024-11-24 01:02:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-24 01:02:25,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:25,192 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-24 01:02:25,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 01:02:25,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -802208970, now seen corresponding path program 1 times [2024-11-24 01:02:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224759070] [2024-11-24 01:02:25,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:26,977 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-24 01:02:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224759070] [2024-11-24 01:02:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224759070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:26,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:02:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958638148] [2024-11-24 01:02:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:26,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 01:02:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:26,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 01:02:26,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:02:26,980 INFO L87 Difference]: Start difference. First operand 220 states and 249 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-24 01:02:28,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:31,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:33,053 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2024-11-24 01:02:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:02:33,054 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-24 01:02:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:33,055 INFO L225 Difference]: With dead ends: 259 [2024-11-24 01:02:33,055 INFO L226 Difference]: Without dead ends: 259 [2024-11-24 01:02:33,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-24 01:02:33,056 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 153 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:33,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 675 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-24 01:02:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-24 01:02:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 220. [2024-11-24 01:02:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 172 states have (on average 1.377906976744186) internal successors, (237), 213 states have internal predecessors, (237), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 245 transitions. [2024-11-24 01:02:33,065 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 245 transitions. Word has length 70 [2024-11-24 01:02:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:33,065 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 245 transitions. [2024-11-24 01:02:33,065 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-24 01:02:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 245 transitions. [2024-11-24 01:02:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-24 01:02:33,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:33,066 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-24 01:02:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 01:02:33,067 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1205316307, now seen corresponding path program 1 times [2024-11-24 01:02:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:33,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12694009] [2024-11-24 01:02:33,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:34,208 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-24 01:02:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12694009] [2024-11-24 01:02:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12694009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:02:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895963037] [2024-11-24 01:02:34,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:02:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:02:34,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:02:34,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:02:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:34,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-24 01:02:34,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:02:34,942 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-24 01:02:35,021 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:02:35,022 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-24 01:02:35,106 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-24 01:02:35,210 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-24 01:02:35,347 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:02:35,347 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-24 01:02:35,471 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:02:35,472 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-24 01:02:35,506 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-24 01:02:35,615 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-24 01:02:35,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:02:35,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4144 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_4144) |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-24 01:02:35,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4144 (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~mem169#1.base| v_ArrVal_4143))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4144)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:02:35,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4144 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4143))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4144)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:02:35,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4142 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4144 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4142))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4143)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4144)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-24 01:02:35,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:02:35,807 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-24 01:02:35,815 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 1672 treesize of output 1304 [2024-11-24 01:02:35,837 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 146 treesize of output 134 [2024-11-24 01:02:35,842 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 134 treesize of output 98 [2024-11-24 01:02:35,848 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 57 treesize of output 39 [2024-11-24 01:02:36,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:02:36,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2024-11-24 01:02:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2024-11-24 01:02:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895963037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:02:38,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:02:38,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2024-11-24 01:02:38,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472457164] [2024-11-24 01:02:38,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:02:38,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 01:02:38,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:38,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 01:02:38,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=298, Unknown=10, NotChecked=156, Total=552 [2024-11-24 01:02:38,022 INFO L87 Difference]: Start difference. First operand 220 states and 245 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-24 01:02:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:45,203 INFO L93 Difference]: Finished difference Result 258 states and 285 transitions. [2024-11-24 01:02:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:02:45,204 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-24 01:02:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:45,205 INFO L225 Difference]: With dead ends: 258 [2024-11-24 01:02:45,205 INFO L226 Difference]: Without dead ends: 258 [2024-11-24 01:02:45,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=352, Unknown=10, NotChecked=172, Total=650 [2024-11-24 01:02:45,207 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 146 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 720 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:45,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 947 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 634 Invalid, 0 Unknown, 720 Unchecked, 7.0s Time] [2024-11-24 01:02:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-24 01:02:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2024-11-24 01:02:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 212 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:02:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 243 transitions. [2024-11-24 01:02:45,214 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 243 transitions. Word has length 75 [2024-11-24 01:02:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 243 transitions. [2024-11-24 01:02:45,215 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-24 01:02:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2024-11-24 01:02:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-24 01:02:45,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:45,216 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-24 01:02:45,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 01:02:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:02:45,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:02:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1205316306, now seen corresponding path program 1 times [2024-11-24 01:02:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:02:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502529880] [2024-11-24 01:02:45,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:02:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:47,372 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-24 01:02:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:02:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502529880] [2024-11-24 01:02:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502529880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:02:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095976365] [2024-11-24 01:02:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:02:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:02:47,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:02:47,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:02:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:48,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-24 01:02:48,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:02:48,179 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-24 01:02:48,219 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-24 01:02:48,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:02:48,238 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-24 01:02:48,313 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-24 01:02:48,319 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-24 01:02:48,414 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-24 01:02:48,419 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-24 01:02:48,550 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:02:48,550 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-24 01:02:48,564 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-24 01:02:48,805 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:02:48,806 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-24 01:02:48,815 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-24 01:02:49,006 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-24 01:02:49,015 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-24 01:02:49,081 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-24 01:02:49,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:02:49,999 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_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4588))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_4590 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4589) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_4590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< .cse0 0))))) (forall ((v_ArrVal_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4588))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0) (forall ((v_ArrVal_4590 (Array Int Int)) (v_ArrVal_4591 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4589))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_4590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-24 01:02:50,089 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_4586 (Array Int Int)) (v_ArrVal_4587 (Array Int Int)) (v_ArrVal_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4587))) (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_~mem_track~0#1.base| v_ArrVal_4586) .cse3 v_ArrVal_4588))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 0) (forall ((v_ArrVal_4590 (Array Int Int))) (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_4589) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_4590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2))))))))) (forall ((v_ArrVal_4586 (Array Int Int)) (v_ArrVal_4587 (Array Int Int)) (v_ArrVal_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4587))) (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_~mem_track~0#1.base| v_ArrVal_4586) .cse9 v_ArrVal_4588))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0) (forall ((v_ArrVal_4590 (Array Int Int)) (v_ArrVal_4591 (Array Int Int))) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_4589))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_4590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_4591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) is different from false [2024-11-24 01:02:50,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:02:50,228 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 471 treesize of output 424 [2024-11-24 01:02:50,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:02:50,247 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 411 treesize of output 268 [2024-11-24 01:02:50,277 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 20168 treesize of output 16464 [2024-11-24 01:02:50,407 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 13356 treesize of output 12644 [2024-11-24 01:02:50,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 526 treesize of output 514 [2024-11-24 01:02:50,505 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 514 treesize of output 448 [2024-11-24 01:02:50,517 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 448 treesize of output 424 [2024-11-24 01:02:50,531 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 424 treesize of output 400 [2024-11-24 01:02:50,543 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 400 treesize of output 352 [2024-11-24 01:02:50,555 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 352 treesize of output 340 [2024-11-24 01:02:50,569 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 340 treesize of output 328 [2024-11-24 01:02:50,581 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 328 treesize of output 310 [2024-11-24 01:02:50,593 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 310 treesize of output 286 [2024-11-24 01:02:50,606 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 286 treesize of output 274 [2024-11-24 01:02:50,617 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 274 treesize of output 268 [2024-11-24 01:02:50,988 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-24 01:02:50,989 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-24 01:02:51,003 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-24 01:02:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095976365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:02:51,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:02:51,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-11-24 01:02:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829766980] [2024-11-24 01:02:51,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:02:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-24 01:02:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:02:51,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-24 01:02:51,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=806, Unknown=5, NotChecked=118, Total=1056 [2024-11-24 01:02:51,005 INFO L87 Difference]: Start difference. First operand 219 states and 243 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-24 01:02:52,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:58,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:03:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:03:04,295 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2024-11-24 01:03:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:03:04,296 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-24 01:03:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:03:04,298 INFO L225 Difference]: With dead ends: 278 [2024-11-24 01:03:04,298 INFO L226 Difference]: Without dead ends: 278 [2024-11-24 01:03:04,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=267, Invalid=1376, Unknown=5, NotChecked=158, Total=1806 [2024-11-24 01:03:04,301 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 181 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 11 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:03:04,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1271 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1054 Invalid, 26 Unknown, 383 Unchecked, 12.4s Time] [2024-11-24 01:03:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-24 01:03:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 239. [2024-11-24 01:03:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 232 states have internal predecessors, (259), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:03:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2024-11-24 01:03:04,312 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 75 [2024-11-24 01:03:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:03:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2024-11-24 01:03:04,313 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-24 01:03:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2024-11-24 01:03:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-24 01:03:04,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:03:04,314 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-24 01:03:04,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:03:04,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:03:04,515 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:03:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:03:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 523547003, now seen corresponding path program 1 times [2024-11-24 01:03:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:03:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296475364] [2024-11-24 01:03:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:03:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:03:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:03:04,881 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-24 01:03:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:03:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296475364] [2024-11-24 01:03:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296475364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:03:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968503493] [2024-11-24 01:03:04,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:03:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:03:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:03:04,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:03:04,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:03:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:03:05,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:03:05,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:03:05,753 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-24 01:03:05,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:03:05,841 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-24 01:03:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968503493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:03:05,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:03:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-24 01:03:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132966325] [2024-11-24 01:03:05,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:03:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:03:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:03:05,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:03:05,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:03:05,843 INFO L87 Difference]: Start difference. First operand 239 states and 267 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-24 01:03:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:03:05,930 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2024-11-24 01:03:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:03:05,930 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-24 01:03:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:03:05,932 INFO L225 Difference]: With dead ends: 268 [2024-11-24 01:03:05,932 INFO L226 Difference]: Without dead ends: 268 [2024-11-24 01:03:05,932 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-24 01:03:05,934 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 16 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:03:05,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 700 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:03:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-24 01:03:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2024-11-24 01:03:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 256 states have internal predecessors, (287), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 01:03:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2024-11-24 01:03:05,950 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 81 [2024-11-24 01:03:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:03:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2024-11-24 01:03:05,953 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-24 01:03:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2024-11-24 01:03:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-24 01:03:05,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:03:05,954 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-24 01:03:05,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-24 01:03:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:03:06,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-24 01:03:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:03:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -7816658, now seen corresponding path program 2 times [2024-11-24 01:03:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:03:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821892493] [2024-11-24 01:03:06,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:03:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:03:06,386 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:03:06,386 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:03:08,604 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-24 01:03:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:03:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821892493] [2024-11-24 01:03:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821892493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:03:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616129587] [2024-11-24 01:03:08,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:03:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:03:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:03:08,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:03:08,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd9b3b3-e86a-478d-81a7-e97eea7fc515/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 01:03:20,370 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:03:20,370 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:03:20,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-24 01:03:20,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:03:20,396 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-24 01:03:20,426 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-24 01:03:20,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:03:20,443 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-24 01:03:20,506 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-24 01:03:20,516 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-24 01:03:20,642 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-24 01:03:20,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-24 01:03:20,830 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:03:20,830 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-24 01:03:20,843 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-24 01:03:21,126 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:03:21,126 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-24 01:03:21,144 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-24 01:03:21,461 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:03:21,462 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-24 01:03:21,489 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-24 01:03:21,867 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-24 01:03:21,868 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-24 01:03:21,886 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-24 01:03:21,993 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-24 01:03:21,999 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-24 01:03:22,055 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-24 01:03:22,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:03:22,412 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_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:03:22,439 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_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-24 01:03:22,456 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_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5516) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5515))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5516) .cse1 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-24 01:03:22,487 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_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5515))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5516) .cse1 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5516) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-24 01:03:22,527 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_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5515))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5516) .cse1 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5516) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-24 01:03:22,561 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_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5513))) (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~mem170#1.base| v_ArrVal_5514) .cse0 v_ArrVal_5516) (select (select (store .cse1 .cse0 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5518))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5513))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_5515))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5514) .cse3 v_ArrVal_5516) .cse4 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-24 01:03:22,632 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_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5513))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5514) .cse1 v_ArrVal_5516) (select (select (store .cse2 .cse1 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5518))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5513))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5515))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5514) .cse4 v_ArrVal_5516) .cse5 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2024-11-24 01:03:22,942 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_5512 (Array Int Int)) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5512))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_5513))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_5515))) (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~mem169#1.base| v_ArrVal_5511) .cse0 v_ArrVal_5514) .cse1 v_ArrVal_5516) .cse2 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_5512 (Array Int Int)) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5512))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5513))) (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~mem169#1.base| v_ArrVal_5511) .cse7 v_ArrVal_5514) .cse8 v_ArrVal_5516) (select (select (store .cse9 .cse8 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5518))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) is different from false [2024-11-24 01:03:30,709 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_5510 (Array Int Int)) (v_ArrVal_5512 (Array Int Int)) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5517 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5510))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_5512))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_5513))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_5515))) (let ((.cse3 (select (select .cse5 |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_5509) .cse0 v_ArrVal_5511) .cse1 v_ArrVal_5514) .cse2 v_ArrVal_5516) .cse3 v_ArrVal_5518) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_5517) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_5510 (Array Int Int)) (v_ArrVal_5512 (Array Int Int)) (v_ArrVal_5511 (Array Int Int)) (v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5516 (Array Int Int)) (v_ArrVal_5515 (Array Int Int)) (v_ArrVal_5518 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5510))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_5512))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_5513))) (let ((.cse11 (select (select .cse12 |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_5509) .cse9 v_ArrVal_5511) .cse10 v_ArrVal_5514) .cse11 v_ArrVal_5516) (select (select (store .cse12 .cse11 v_ArrVal_5515) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5518))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3))))) is different from false [2024-11-24 01:03:30,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:03:30,784 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-24 01:03:30,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:03:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 239 [2024-11-24 01:03:30,859 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 22458408 treesize of output 18911312 [2024-11-24 01:04:00,023 WARN L286 SmtUtils]: Spent 29.16s on a formula simplification. DAG size of input: 1814 DAG size of output: 529 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:04:00,982 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 387701120 treesize of output 383594232 [2024-11-24 01:04:24,413 WARN L286 SmtUtils]: Spent 23.41s on a formula simplification. DAG size of input: 4486 DAG size of output: 431 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:04:25,441 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 125204 treesize of output 115904 [2024-11-24 01:04:26,336 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 115904 treesize of output 103604 [2024-11-24 01:04:27,244 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 103604 treesize of output 101606 [2024-11-24 01:04:28,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 101606 treesize of output 100280 [2024-11-24 01:04:28,940 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 100280 treesize of output 91016 [2024-11-24 01:04:29,727 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 91016 treesize of output 76562 [2024-11-24 01:04:30,549 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 76562 treesize of output 74228 [2024-11-24 01:04:31,355 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 74228 treesize of output 66848 [2024-11-24 01:04:32,327 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 66848 treesize of output 65546