./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU --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 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:18:32,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:18:32,470 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:18:32,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:18:32,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:18:32,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:18:32,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:18:32,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:18:32,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:18:32,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:18:32,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:18:32,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:18:32,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:18:32,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:18:32,538 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:18:32,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:18:32,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:18:32,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:18:32,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:18:32,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:18:32,540 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:18:32,543 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:18:32,544 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:18:32,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:18:32,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:18:32,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:18:32,545 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:18:32,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:18:32,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:18:32,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:18:32,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:18:32,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:18:32,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:18:32,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:32,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:18:32,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:18:32,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:18:32,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:18:32,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:18:32,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:18:32,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:18:32,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:18:32,552 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-10-31 22:18:32,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:18:32,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:18:32,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:18:32,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:18:32,967 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:18:32,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i Unable to find full path for "g++" [2024-10-31 22:18:35,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:18:35,536 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:18:35,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-10-31 22:18:35,560 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/data/25ec0c637/37ccd323af054823803a2547814acd02/FLAG25da9762f [2024-10-31 22:18:35,821 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/data/25ec0c637/37ccd323af054823803a2547814acd02 [2024-10-31 22:18:35,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:18:35,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:18:35,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:35,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:18:35,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:18:35,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:35" (1/1) ... [2024-10-31 22:18:35,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794d7339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:35, skipping insertion in model container [2024-10-31 22:18:35,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:35" (1/1) ... [2024-10-31 22:18:35,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:18:36,230 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:18:36,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:36,270 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:18:36,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:36,379 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:18:36,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36 WrapperNode [2024-10-31 22:18:36,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:36,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:36,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:18:36,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:18:36,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,436 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-10-31 22:18:36,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:36,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:18:36,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:18:36,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:18:36,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,471 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-10-31 22:18:36,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:18:36,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:18:36,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:18:36,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:18:36,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (1/1) ... [2024-10-31 22:18:36,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:36,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:18:36,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:18:36,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:18:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:18:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:18:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:18:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:18:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:18:36,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:18:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:18:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 22:18:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 22:18:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-31 22:18:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:18:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:18:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:18:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:18:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:18:36,754 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:18:36,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:18:37,177 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-31 22:18:37,178 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:18:37,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:18:37,199 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 22:18:37,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:37 BoogieIcfgContainer [2024-10-31 22:18:37,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:18:37,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:18:37,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:18:37,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:18:37,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:18:35" (1/3) ... [2024-10-31 22:18:37,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac12cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:37, skipping insertion in model container [2024-10-31 22:18:37,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:36" (2/3) ... [2024-10-31 22:18:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac12cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:37, skipping insertion in model container [2024-10-31 22:18:37,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:37" (3/3) ... [2024-10-31 22:18:37,213 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-10-31 22:18:37,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:18:37,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-31 22:18:37,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:18:37,297 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;@6287705e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:18:37,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-31 22:18:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:18:37,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:37,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:18:37,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:37,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-10-31 22:18:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387671412] [2024-10-31 22:18:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:37,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387671412] [2024-10-31 22:18:37,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387671412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496883555] [2024-10-31 22:18:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:37,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:37,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:37,808 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:38,081 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-10-31 22:18:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:38,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-10-31 22:18:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:38,095 INFO L225 Difference]: With dead ends: 106 [2024-10-31 22:18:38,095 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:18:38,097 INFO L431 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-10-31 22:18:38,102 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:38,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:18:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-10-31 22:18:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-10-31 22:18:38,144 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2024-10-31 22:18:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-10-31 22:18:38,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-10-31 22:18:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:18:38,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:38,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:18:38,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:18:38,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-10-31 22:18:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:38,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93759314] [2024-10-31 22:18:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:38,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93759314] [2024-10-31 22:18:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93759314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684202052] [2024-10-31 22:18:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:38,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:38,407 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:38,686 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-10-31 22:18:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-10-31 22:18:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:38,690 INFO L225 Difference]: With dead ends: 137 [2024-10-31 22:18:38,690 INFO L226 Difference]: Without dead ends: 137 [2024-10-31 22:18:38,691 INFO L431 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-10-31 22:18:38,693 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:38,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-31 22:18:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2024-10-31 22:18:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 106 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-10-31 22:18:38,712 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 4 [2024-10-31 22:18:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:38,713 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-10-31 22:18:38,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-10-31 22:18:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:18:38,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:38,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:18:38,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:18:38,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-10-31 22:18:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574563876] [2024-10-31 22:18:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574563876] [2024-10-31 22:18:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574563876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:38,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30614776] [2024-10-31 22:18:38,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:38,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:38,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:38,793 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:38,905 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-31 22:18:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:38,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-31 22:18:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:38,907 INFO L225 Difference]: With dead ends: 105 [2024-10-31 22:18:38,907 INFO L226 Difference]: Without dead ends: 105 [2024-10-31 22:18:38,908 INFO L431 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-10-31 22:18:38,909 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:38,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-31 22:18:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-31 22:18:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-31 22:18:38,918 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 5 [2024-10-31 22:18:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-31 22:18:38,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-31 22:18:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:18:38,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:38,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:18:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:18:38,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:38,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-10-31 22:18:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:38,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278814646] [2024-10-31 22:18:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278814646] [2024-10-31 22:18:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278814646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413840088] [2024-10-31 22:18:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:39,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:39,021 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:39,113 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-31 22:18:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-31 22:18:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:39,114 INFO L225 Difference]: With dead ends: 103 [2024-10-31 22:18:39,115 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 22:18:39,115 INFO L431 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-10-31 22:18:39,116 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:39,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 22:18:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 22:18:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-10-31 22:18:39,135 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-10-31 22:18:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:39,136 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-10-31 22:18:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-10-31 22:18:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:18:39,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:39,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:39,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:18:39,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2024-10-31 22:18:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:39,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183883153] [2024-10-31 22:18:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183883153] [2024-10-31 22:18:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183883153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:39,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66267589] [2024-10-31 22:18:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:39,235 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:39,353 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-31 22:18:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:39,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-31 22:18:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:39,355 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:18:39,355 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:18:39,355 INFO L431 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-10-31 22:18:39,356 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:39,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:18:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 22:18:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-31 22:18:39,363 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-10-31 22:18:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-31 22:18:39,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-31 22:18:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:18:39,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:39,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:18:39,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2024-10-31 22:18:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670619607] [2024-10-31 22:18:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670619607] [2024-10-31 22:18:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670619607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:39,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:39,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:39,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579895768] [2024-10-31 22:18:39,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:39,477 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:39,556 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-10-31 22:18:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-31 22:18:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:39,557 INFO L225 Difference]: With dead ends: 95 [2024-10-31 22:18:39,558 INFO L226 Difference]: Without dead ends: 95 [2024-10-31 22:18:39,558 INFO L431 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-10-31 22:18:39,559 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:39,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-31 22:18:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 22:18:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-31 22:18:39,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-10-31 22:18:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:39,572 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-31 22:18:39,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-31 22:18:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:18:39,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:39,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:39,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:18:39,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-10-31 22:18:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610425236] [2024-10-31 22:18:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610425236] [2024-10-31 22:18:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610425236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965388952] [2024-10-31 22:18:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:39,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:39,730 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:39,871 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-10-31 22:18:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:18:39,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-10-31 22:18:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:39,873 INFO L225 Difference]: With dead ends: 104 [2024-10-31 22:18:39,873 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:18:39,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:39,874 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:39,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:18:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-10-31 22:18:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-10-31 22:18:39,882 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2024-10-31 22:18:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:39,883 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-10-31 22:18:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-10-31 22:18:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:18:39,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:39,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:39,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:18:39,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-10-31 22:18:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503888339] [2024-10-31 22:18:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503888339] [2024-10-31 22:18:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503888339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:18:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407035943] [2024-10-31 22:18:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:18:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:18:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:40,172 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:40,326 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-31 22:18:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-10-31 22:18:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:40,327 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:18:40,327 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:18:40,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:40,328 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:40,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:18:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 22:18:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-31 22:18:40,333 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 14 [2024-10-31 22:18:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:40,334 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-31 22:18:40,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-31 22:18:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:18:40,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:40,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:18:40,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2024-10-31 22:18:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892889539] [2024-10-31 22:18:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:40,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892889539] [2024-10-31 22:18:40,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892889539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:40,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:18:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331854151] [2024-10-31 22:18:40,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:40,474 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:40,574 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-10-31 22:18:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-10-31 22:18:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:40,576 INFO L225 Difference]: With dead ends: 160 [2024-10-31 22:18:40,576 INFO L226 Difference]: Without dead ends: 160 [2024-10-31 22:18:40,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:40,577 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:40,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-31 22:18:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-10-31 22:18:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-10-31 22:18:40,581 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2024-10-31 22:18:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:40,582 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-10-31 22:18:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-10-31 22:18:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:18:40,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:40,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:18:40,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2024-10-31 22:18:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823634677] [2024-10-31 22:18:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823634677] [2024-10-31 22:18:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823634677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610845992] [2024-10-31 22:18:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:40,883 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:41,093 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-10-31 22:18:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-10-31 22:18:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:41,094 INFO L225 Difference]: With dead ends: 165 [2024-10-31 22:18:41,094 INFO L226 Difference]: Without dead ends: 165 [2024-10-31 22:18:41,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:41,095 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:41,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-31 22:18:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2024-10-31 22:18:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 112 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-10-31 22:18:41,100 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-10-31 22:18:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:41,101 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-10-31 22:18:41,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-10-31 22:18:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:18:41,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:41,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:18:41,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:41,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2024-10-31 22:18:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693031355] [2024-10-31 22:18:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693031355] [2024-10-31 22:18:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693031355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:18:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114817624] [2024-10-31 22:18:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:41,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:18:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:18:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:41,260 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:41,473 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-10-31 22:18:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-10-31 22:18:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:41,475 INFO L225 Difference]: With dead ends: 177 [2024-10-31 22:18:41,476 INFO L226 Difference]: Without dead ends: 177 [2024-10-31 22:18:41,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:18:41,478 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:41,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 208 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-31 22:18:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-10-31 22:18:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-10-31 22:18:41,482 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 18 [2024-10-31 22:18:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-10-31 22:18:41,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-10-31 22:18:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:18:41,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:41,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:41,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:18:41,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2024-10-31 22:18:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669004702] [2024-10-31 22:18:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:41,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669004702] [2024-10-31 22:18:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669004702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849300345] [2024-10-31 22:18:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:41,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:41,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:18:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:41,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 22:18:41,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:41,951 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 6 treesize of output 5 [2024-10-31 22:18:41,991 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-31 22:18:41,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-31 22:18:42,047 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 19 treesize of output 1 [2024-10-31 22:18:42,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:18:42,182 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 42 treesize of output 41 [2024-10-31 22:18:42,248 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 31 treesize of output 13 [2024-10-31 22:18:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:18:42,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:42,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:42,467 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 24 treesize of output 25 [2024-10-31 22:18:42,473 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 40 treesize of output 28 [2024-10-31 22:18:42,485 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 9 treesize of output 5 [2024-10-31 22:18:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849300345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:42,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-10-31 22:18:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909748852] [2024-10-31 22:18:42,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:18:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:18:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-10-31 22:18:42,578 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:43,005 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-10-31 22:18:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 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 20 [2024-10-31 22:18:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:43,006 INFO L225 Difference]: With dead ends: 112 [2024-10-31 22:18:43,006 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:18:43,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-10-31 22:18:43,007 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:43,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 491 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:18:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:18:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.441860465116279) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-10-31 22:18:43,011 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2024-10-31 22:18:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:43,011 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-10-31 22:18:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-10-31 22:18:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:18:43,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:43,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:43,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:18:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-31 22:18:43,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:43,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2024-10-31 22:18:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8695775] [2024-10-31 22:18:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8695775] [2024-10-31 22:18:43,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8695775] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:43,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814860841] [2024-10-31 22:18:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:43,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:43,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:43,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:18:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:43,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-31 22:18:43,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:43,820 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 6 treesize of output 5 [2024-10-31 22:18:43,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:18:43,840 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 11 treesize of output 11 [2024-10-31 22:18:43,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-31 22:18:43,888 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 19 treesize of output 1 [2024-10-31 22:18:43,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-31 22:18:44,085 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:18:44,085 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 62 treesize of output 57 [2024-10-31 22:18:44,092 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 30 treesize of output 13 [2024-10-31 22:18:44,189 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 31 treesize of output 13 [2024-10-31 22:18:44,196 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 9 treesize of output 3 [2024-10-31 22:18:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:44,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:44,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-10-31 22:18:44,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-10-31 22:18:44,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-10-31 22:18:44,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:44,470 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 45 treesize of output 46 [2024-10-31 22:18:44,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:44,479 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 35 treesize of output 36 [2024-10-31 22:18:44,486 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 62 treesize of output 50 [2024-10-31 22:18:44,499 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 96 treesize of output 78 [2024-10-31 22:18:44,507 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 15 treesize of output 11 [2024-10-31 22:18:44,510 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 11 treesize of output 7 [2024-10-31 22:18:44,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:44,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-10-31 22:18:44,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:18:44,532 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 22 treesize of output 10 [2024-10-31 22:18:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-31 22:18:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814860841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:44,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-10-31 22:18:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396209308] [2024-10-31 22:18:44,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-31 22:18:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:44,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-31 22:18:44,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=353, Unknown=3, NotChecked=120, Total=552 [2024-10-31 22:18:44,604 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:45,276 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-10-31 22:18:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:18:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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 20 [2024-10-31 22:18:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:45,278 INFO L225 Difference]: With dead ends: 118 [2024-10-31 22:18:45,278 INFO L226 Difference]: Without dead ends: 118 [2024-10-31 22:18:45,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2024-10-31 22:18:45,279 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:45,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 576 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-10-31 22:18:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-31 22:18:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-31 22:18:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 117 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-10-31 22:18:45,285 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 20 [2024-10-31 22:18:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:45,285 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-10-31 22:18:45,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-10-31 22:18:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:18:45,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:45,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:45,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:18:45,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-31 22:18:45,488 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2024-10-31 22:18:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24742108] [2024-10-31 22:18:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24742108] [2024-10-31 22:18:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24742108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:18:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922081479] [2024-10-31 22:18:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:18:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:18:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:45,659 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:45,886 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2024-10-31 22:18:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:45,887 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), 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 21 [2024-10-31 22:18:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:45,888 INFO L225 Difference]: With dead ends: 186 [2024-10-31 22:18:45,888 INFO L226 Difference]: Without dead ends: 186 [2024-10-31 22:18:45,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:18:45,889 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:45,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 242 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-31 22:18:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 118. [2024-10-31 22:18:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-10-31 22:18:45,893 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 21 [2024-10-31 22:18:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:45,894 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-10-31 22:18:45,894 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-10-31 22:18:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:18:45,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:45,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:45,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:18:45,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:45,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2024-10-31 22:18:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:45,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591150121] [2024-10-31 22:18:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591150121] [2024-10-31 22:18:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591150121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:46,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141129335] [2024-10-31 22:18:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:46,154 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:46,416 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2024-10-31 22:18:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2024-10-31 22:18:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:46,418 INFO L225 Difference]: With dead ends: 167 [2024-10-31 22:18:46,418 INFO L226 Difference]: Without dead ends: 167 [2024-10-31 22:18:46,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:46,419 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:46,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-31 22:18:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 121. [2024-10-31 22:18:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-10-31 22:18:46,424 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 21 [2024-10-31 22:18:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:46,424 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-10-31 22:18:46,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-10-31 22:18:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:18:46,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:46,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:46,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:18:46,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:46,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2024-10-31 22:18:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:46,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17721626] [2024-10-31 22:18:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17721626] [2024-10-31 22:18:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17721626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:46,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:18:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791291800] [2024-10-31 22:18:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:46,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:18:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:18:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:18:46,846 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:47,244 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-10-31 22:18:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:18:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 24 [2024-10-31 22:18:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:47,245 INFO L225 Difference]: With dead ends: 149 [2024-10-31 22:18:47,245 INFO L226 Difference]: Without dead ends: 149 [2024-10-31 22:18:47,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:18:47,246 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:47,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 497 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:18:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-31 22:18:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2024-10-31 22:18:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-10-31 22:18:47,252 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 24 [2024-10-31 22:18:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:47,253 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-10-31 22:18:47,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-10-31 22:18:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:18:47,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:47,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:47,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:18:47,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:47,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2024-10-31 22:18:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131820797] [2024-10-31 22:18:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131820797] [2024-10-31 22:18:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131820797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145675976] [2024-10-31 22:18:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:47,388 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:47,474 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2024-10-31 22:18:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:18:47,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-10-31 22:18:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:47,477 INFO L225 Difference]: With dead ends: 166 [2024-10-31 22:18:47,477 INFO L226 Difference]: Without dead ends: 166 [2024-10-31 22:18:47,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:47,478 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:47,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-31 22:18:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2024-10-31 22:18:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-10-31 22:18:47,484 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 26 [2024-10-31 22:18:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:47,484 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-10-31 22:18:47,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-10-31 22:18:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:18:47,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:47,485 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:18:47,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1517665639, now seen corresponding path program 2 times [2024-10-31 22:18:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:47,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729174357] [2024-10-31 22:18:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729174357] [2024-10-31 22:18:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729174357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298474039] [2024-10-31 22:18:48,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:18:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:48,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:48,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:18:48,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:18:48,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:18:48,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-31 22:18:48,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:48,280 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 6 treesize of output 5 [2024-10-31 22:18:48,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:18:48,300 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 11 treesize of output 11 [2024-10-31 22:18:48,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-31 22:18:48,323 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 19 treesize of output 1 [2024-10-31 22:18:48,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-31 22:18:48,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:18:48,457 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 62 treesize of output 57 [2024-10-31 22:18:48,464 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 30 treesize of output 13 [2024-10-31 22:18:48,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:18:48,640 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 62 treesize of output 57 [2024-10-31 22:18:48,646 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 30 treesize of output 13 [2024-10-31 22:18:48,755 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 31 treesize of output 13 [2024-10-31 22:18:48,761 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 9 treesize of output 3 [2024-10-31 22:18:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:48,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:18:49,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-10-31 22:18:49,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2024-10-31 22:18:49,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) .cse2 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-10-31 22:18:49,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:49,435 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 89 treesize of output 90 [2024-10-31 22:18:49,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:49,445 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 79 treesize of output 60 [2024-10-31 22:18:49,457 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 754 treesize of output 640 [2024-10-31 22:18:49,484 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 415 treesize of output 385 [2024-10-31 22:18:49,495 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 132 treesize of output 104 [2024-10-31 22:18:49,500 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 104 treesize of output 96 [2024-10-31 22:18:49,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 96 treesize of output 84 [2024-10-31 22:18:49,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-10-31 22:18:49,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:49,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-10-31 22:18:49,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:49,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-31 22:18:49,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:18:49,572 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 34 treesize of output 22 [2024-10-31 22:18:49,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:18:49,579 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 22 treesize of output 10 [2024-10-31 22:18:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-10-31 22:18:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298474039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:18:49,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:18:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 27 [2024-10-31 22:18:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366124955] [2024-10-31 22:18:49,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:18:49,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-31 22:18:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-31 22:18:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=471, Unknown=25, NotChecked=144, Total=756 [2024-10-31 22:18:49,655 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:50,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (<= (+ .cse0 .cse3 8) (select |c_#length| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 (+ .cse0 .cse3 4))))) is different from false [2024-10-31 22:18:50,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (<= (+ .cse0 .cse3 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 .cse3 4))))) is different from false [2024-10-31 22:18:50,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (<= 0 (+ .cse0 .cse3)) (<= (+ .cse0 .cse3 4) (select |c_#length| .cse1)) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-10-31 22:18:50,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-10-31 22:18:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:51,002 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2024-10-31 22:18:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-31 22:18:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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 26 [2024-10-31 22:18:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:51,004 INFO L225 Difference]: With dead ends: 170 [2024-10-31 22:18:51,004 INFO L226 Difference]: Without dead ends: 170 [2024-10-31 22:18:51,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=232, Invalid=889, Unknown=29, NotChecked=490, Total=1640 [2024-10-31 22:18:51,006 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:51,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 739 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 21 Unknown, 373 Unchecked, 0.8s Time] [2024-10-31 22:18:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-31 22:18:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-10-31 22:18:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.375886524822695) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-10-31 22:18:51,013 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2024-10-31 22:18:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-10-31 22:18:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-10-31 22:18:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:18:51,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:51,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:51,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-31 22:18:51,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-31 22:18:51,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1792581374, now seen corresponding path program 1 times [2024-10-31 22:18:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75282124] [2024-10-31 22:18:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75282124] [2024-10-31 22:18:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75282124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:18:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604355682] [2024-10-31 22:18:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:18:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:18:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:18:51,405 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:51,576 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2024-10-31 22:18:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:18:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-10-31 22:18:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:51,578 INFO L225 Difference]: With dead ends: 246 [2024-10-31 22:18:51,579 INFO L226 Difference]: Without dead ends: 246 [2024-10-31 22:18:51,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:51,580 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 74 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:51,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 261 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-31 22:18:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 168. [2024-10-31 22:18:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2024-10-31 22:18:51,585 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 27 [2024-10-31 22:18:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2024-10-31 22:18:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2024-10-31 22:18:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:18:51,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:51,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:51,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:18:51,587 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:51,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 264552428, now seen corresponding path program 1 times [2024-10-31 22:18:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811958036] [2024-10-31 22:18:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811958036] [2024-10-31 22:18:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811958036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:51,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:18:51,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676613967] [2024-10-31 22:18:51,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:51,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:18:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:18:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:18:51,757 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:52,014 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2024-10-31 22:18:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:52,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2024-10-31 22:18:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:52,016 INFO L225 Difference]: With dead ends: 249 [2024-10-31 22:18:52,016 INFO L226 Difference]: Without dead ends: 249 [2024-10-31 22:18:52,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:18:52,017 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 65 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:52,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 248 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-31 22:18:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 171. [2024-10-31 22:18:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 145 states have (on average 1.3655172413793104) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2024-10-31 22:18:52,023 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2024-10-31 22:18:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:52,023 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2024-10-31 22:18:52,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2024-10-31 22:18:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:18:52,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:52,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:18:52,025 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -388809147, now seen corresponding path program 1 times [2024-10-31 22:18:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369586752] [2024-10-31 22:18:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:52,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369586752] [2024-10-31 22:18:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369586752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:52,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:52,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:18:52,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630439738] [2024-10-31 22:18:52,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:52,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:18:52,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:18:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:18:52,321 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:52,542 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2024-10-31 22:18:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:18:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-10-31 22:18:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:52,544 INFO L225 Difference]: With dead ends: 193 [2024-10-31 22:18:52,544 INFO L226 Difference]: Without dead ends: 193 [2024-10-31 22:18:52,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:18:52,545 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 141 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:52,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 190 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-31 22:18:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2024-10-31 22:18:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.36986301369863) internal successors, (200), 171 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2024-10-31 22:18:52,550 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 29 [2024-10-31 22:18:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:52,550 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2024-10-31 22:18:52,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2024-10-31 22:18:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:18:52,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:52,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:52,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:18:52,552 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:52,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -388809146, now seen corresponding path program 1 times [2024-10-31 22:18:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330474295] [2024-10-31 22:18:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330474295] [2024-10-31 22:18:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330474295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976163170] [2024-10-31 22:18:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:52,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:52,625 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:52,690 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2024-10-31 22:18:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-10-31 22:18:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:52,693 INFO L225 Difference]: With dead ends: 167 [2024-10-31 22:18:52,693 INFO L226 Difference]: Without dead ends: 167 [2024-10-31 22:18:52,694 INFO L431 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-10-31 22:18:52,694 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 111 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:52,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-31 22:18:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-31 22:18:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 166 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2024-10-31 22:18:52,700 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 29 [2024-10-31 22:18:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:52,700 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2024-10-31 22:18:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2024-10-31 22:18:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:18:52,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:52,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:52,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:18:52,702 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056854, now seen corresponding path program 1 times [2024-10-31 22:18:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991171292] [2024-10-31 22:18:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991171292] [2024-10-31 22:18:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991171292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:18:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980962497] [2024-10-31 22:18:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:18:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:18:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:18:53,283 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:53,713 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2024-10-31 22:18:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:18:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2024-10-31 22:18:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:53,715 INFO L225 Difference]: With dead ends: 201 [2024-10-31 22:18:53,715 INFO L226 Difference]: Without dead ends: 201 [2024-10-31 22:18:53,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:18:53,716 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:53,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 465 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-31 22:18:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 176. [2024-10-31 22:18:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3419354838709678) internal successors, (208), 175 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-10-31 22:18:53,720 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 29 [2024-10-31 22:18:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:53,721 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-10-31 22:18:53,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-10-31 22:18:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:18:53,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:53,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:18:53,722 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056855, now seen corresponding path program 1 times [2024-10-31 22:18:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589460314] [2024-10-31 22:18:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:54,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589460314] [2024-10-31 22:18:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589460314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:18:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989515334] [2024-10-31 22:18:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:18:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:18:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:18:54,165 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:54,600 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-10-31 22:18:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:18:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2024-10-31 22:18:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:54,601 INFO L225 Difference]: With dead ends: 200 [2024-10-31 22:18:54,601 INFO L226 Difference]: Without dead ends: 200 [2024-10-31 22:18:54,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:18:54,602 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:54,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 449 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-31 22:18:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 182. [2024-10-31 22:18:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2024-10-31 22:18:54,607 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 29 [2024-10-31 22:18:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:54,608 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2024-10-31 22:18:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2024-10-31 22:18:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:18:54,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:54,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:18:54,609 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1276636110, now seen corresponding path program 1 times [2024-10-31 22:18:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194234479] [2024-10-31 22:18:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194234479] [2024-10-31 22:18:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194234479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:55,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:18:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57548707] [2024-10-31 22:18:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:18:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:18:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:18:55,458 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:56,011 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2024-10-31 22:18:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:18:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 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 32 [2024-10-31 22:18:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:56,013 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:18:56,013 INFO L226 Difference]: Without dead ends: 206 [2024-10-31 22:18:56,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-10-31 22:18:56,014 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:56,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 488 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:18:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-31 22:18:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2024-10-31 22:18:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 181 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2024-10-31 22:18:56,019 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 32 [2024-10-31 22:18:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:56,020 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2024-10-31 22:18:56,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2024-10-31 22:18:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:18:56,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:56,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:56,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 22:18:56,025 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:56,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1276647095, now seen corresponding path program 1 times [2024-10-31 22:18:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966132712] [2024-10-31 22:18:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966132712] [2024-10-31 22:18:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966132712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:18:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032840093] [2024-10-31 22:18:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:18:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:18:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:18:56,448 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:56,854 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-10-31 22:18:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:18:56,855 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), 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 32 [2024-10-31 22:18:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:56,856 INFO L225 Difference]: With dead ends: 203 [2024-10-31 22:18:56,856 INFO L226 Difference]: Without dead ends: 203 [2024-10-31 22:18:56,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:18:56,857 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 71 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:56,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 488 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:18:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-31 22:18:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 182. [2024-10-31 22:18:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 181 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2024-10-31 22:18:56,862 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 32 [2024-10-31 22:18:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:56,862 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2024-10-31 22:18:56,862 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2024-10-31 22:18:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:18:56,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:56,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 22:18:56,863 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 921013898, now seen corresponding path program 1 times [2024-10-31 22:18:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103288430] [2024-10-31 22:18:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103288430] [2024-10-31 22:18:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103288430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-31 22:18:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926968793] [2024-10-31 22:18:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:18:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:18:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:18:57,642 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:58,370 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2024-10-31 22:18:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:18:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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 33 [2024-10-31 22:18:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:58,371 INFO L225 Difference]: With dead ends: 197 [2024-10-31 22:18:58,372 INFO L226 Difference]: Without dead ends: 195 [2024-10-31 22:18:58,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-10-31 22:18:58,372 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:58,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 724 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-31 22:18:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2024-10-31 22:18:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 176 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2024-10-31 22:18:58,377 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 33 [2024-10-31 22:18:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:58,377 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2024-10-31 22:18:58,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2024-10-31 22:18:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:18:58,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:58,378 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:58,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 22:18:58,379 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:18:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -338052361, now seen corresponding path program 1 times [2024-10-31 22:18:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927810997] [2024-10-31 22:18:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927810997] [2024-10-31 22:18:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927810997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:18:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295690215] [2024-10-31 22:18:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:58,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:18:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:58,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:18:58,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a119029-7aff-4041-a476-ee2305c08bd5/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:18:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:59,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-31 22:18:59,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:18:59,230 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-31 22:18:59,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-10-31 22:18:59,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:18:59,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 69 [2024-10-31 22:18:59,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-31 22:19:00,196 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| Int) (|v_ULTIMATE.start_main_#t~mem22#1.base_9| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|) 0) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0) |v_ULTIMATE.start_main_~#list~0#1.base_22| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_9|) 0))) is different from true [2024-10-31 22:19:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:00,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:19:00,420 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 8 treesize of output 4 [2024-10-31 22:19:00,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_753) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-10-31 22:19:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295690215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:19:00,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:19:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-10-31 22:19:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666281748] [2024-10-31 22:19:00,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:19:00,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-31 22:19:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-31 22:19:00,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=397, Unknown=3, NotChecked=82, Total=552 [2024-10-31 22:19:00,636 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 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)