./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 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_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ --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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:44:05,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:44:06,036 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 21:44:06,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:44:06,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:44:06,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:44:06,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:44:06,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:44:06,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:44:06,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:44:06,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:44:06,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:44:06,101 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:44:06,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:44:06,104 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:44:06,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:44:06,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:44:06,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:44:06,105 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:44:06,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:44:06,106 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:44:06,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:44:06,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:44:06,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:44:06,108 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:44:06,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:44:06,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:44:06,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:44:06,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:44:06,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:44:06,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:44:06,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:44:06,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:44:06,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:44:06,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:44:06,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:44:06,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:44:06,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:44:06,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:44:06,115 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_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/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_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ 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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2023-11-23 21:44:06,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:44:06,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:44:06,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:44:06,465 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:44:06,465 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:44:06,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-23 21:44:09,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:44:09,801 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:44:09,802 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/sv-benchmarks/c/heap-manipulation/tree-2.i [2023-11-23 21:44:09,817 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/data/a9a5b6ee3/a07973855921439faed6ad25260a817b/FLAGebf83d4af [2023-11-23 21:44:09,832 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/data/a9a5b6ee3/a07973855921439faed6ad25260a817b [2023-11-23 21:44:09,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:44:09,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:44:09,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:44:09,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:44:09,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:44:09,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:44:09" (1/1) ... [2023-11-23 21:44:09,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902ae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:09, skipping insertion in model container [2023-11-23 21:44:09,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:44:09" (1/1) ... [2023-11-23 21:44:09,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:44:10,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:44:10,331 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:44:10,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:44:10,450 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:44:10,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10 WrapperNode [2023-11-23 21:44:10,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:44:10,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:44:10,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:44:10,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:44:10,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,533 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2023-11-23 21:44:10,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:44:10,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:44:10,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:44:10,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:44:10,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:44:10,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:44:10,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:44:10,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:44:10,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (1/1) ... [2023-11-23 21:44:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:44:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:10,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:44:10,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:44:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:44:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-23 21:44:10,699 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-23 21:44:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:44:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:44:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:44:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:44:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:44:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:44:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:44:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:44:10,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:44:10,870 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:44:10,873 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:44:11,467 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:44:11,532 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:44:11,533 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-23 21:44:11,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:44:11 BoogieIcfgContainer [2023-11-23 21:44:11,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:44:11,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:44:11,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:44:11,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:44:11,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:44:09" (1/3) ... [2023-11-23 21:44:11,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2227ea60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:44:11, skipping insertion in model container [2023-11-23 21:44:11,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:10" (2/3) ... [2023-11-23 21:44:11,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2227ea60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:44:11, skipping insertion in model container [2023-11-23 21:44:11,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:44:11" (3/3) ... [2023-11-23 21:44:11,544 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2023-11-23 21:44:11,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:44:11,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2023-11-23 21:44:11,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:44:11,636 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7bdcd952, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:44:11,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-11-23 21:44:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 65 states have (on average 2.4) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:44:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 21:44:11,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:11,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 21:44:11,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:11,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 10001127, now seen corresponding path program 1 times [2023-11-23 21:44:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309560682] [2023-11-23 21:44:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:11,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309560682] [2023-11-23 21:44:11,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309560682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:11,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:11,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:44:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818314683] [2023-11-23 21:44:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:11,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:44:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:44:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:44:11,855 INFO L87 Difference]: Start difference. First operand has 133 states, 65 states have (on average 2.4) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-23 21:44:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:11,920 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-11-23 21:44:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:44:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-11-23 21:44:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:11,933 INFO L225 Difference]: With dead ends: 131 [2023-11-23 21:44:11,934 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 21:44:11,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:44:11,940 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:11,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:44:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 21:44:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-23 21:44:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 64 states have (on average 2.15625) internal successors, (138), 128 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2023-11-23 21:44:11,991 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 4 [2023-11-23 21:44:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:11,992 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2023-11-23 21:44:11,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-11-23 21:44:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2023-11-23 21:44:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:44:11,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:11,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:44:11,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:44:11,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:11,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 309014355, now seen corresponding path program 1 times [2023-11-23 21:44:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503060935] [2023-11-23 21:44:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503060935] [2023-11-23 21:44:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503060935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:12,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:44:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181156284] [2023-11-23 21:44:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:12,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:12,080 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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) [2023-11-23 21:44:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:12,187 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-11-23 21:44:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 [2023-11-23 21:44:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:12,190 INFO L225 Difference]: With dead ends: 133 [2023-11-23 21:44:12,191 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 21:44:12,191 INFO L412 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 [2023-11-23 21:44:12,193 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:12,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 21:44:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 21:44:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-11-23 21:44:12,210 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 5 [2023-11-23 21:44:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:12,210 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-11-23 21:44:12,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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) [2023-11-23 21:44:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-11-23 21:44:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:44:12,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:12,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:44:12,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:44:12,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:12,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 309015255, now seen corresponding path program 1 times [2023-11-23 21:44:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358064322] [2023-11-23 21:44:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358064322] [2023-11-23 21:44:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358064322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:12,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:44:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515111761] [2023-11-23 21:44:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:12,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:12,412 INFO L87 Difference]: Start difference. First operand 133 states and 145 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) [2023-11-23 21:44:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:12,614 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2023-11-23 21:44:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:12,615 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 [2023-11-23 21:44:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:12,620 INFO L225 Difference]: With dead ends: 157 [2023-11-23 21:44:12,620 INFO L226 Difference]: Without dead ends: 157 [2023-11-23 21:44:12,621 INFO L412 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 [2023-11-23 21:44:12,630 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:12,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 171 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-23 21:44:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2023-11-23 21:44:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 140 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2023-11-23 21:44:12,657 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 5 [2023-11-23 21:44:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:12,659 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2023-11-23 21:44:12,659 INFO L496 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) [2023-11-23 21:44:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2023-11-23 21:44:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:44:12,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:12,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:44:12,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:44:12,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:12,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash 309015254, now seen corresponding path program 1 times [2023-11-23 21:44:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702354050] [2023-11-23 21:44:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:12,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702354050] [2023-11-23 21:44:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702354050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:12,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:44:12,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609064187] [2023-11-23 21:44:12,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:12,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:12,746 INFO L87 Difference]: Start difference. First operand 142 states and 169 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) [2023-11-23 21:44:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:12,893 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2023-11-23 21:44:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:12,893 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 [2023-11-23 21:44:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:12,894 INFO L225 Difference]: With dead ends: 135 [2023-11-23 21:44:12,894 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 21:44:12,895 INFO L412 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 [2023-11-23 21:44:12,896 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:12,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 21:44:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-11-23 21:44:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.9240506329113924) internal successors, (152), 132 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2023-11-23 21:44:12,906 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 5 [2023-11-23 21:44:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:12,906 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2023-11-23 21:44:12,906 INFO L496 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) [2023-11-23 21:44:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2023-11-23 21:44:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 21:44:12,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:12,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:12,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:44:12,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:12,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 610217864, now seen corresponding path program 1 times [2023-11-23 21:44:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620189137] [2023-11-23 21:44:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:12,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:12,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620189137] [2023-11-23 21:44:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620189137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:12,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:12,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:44:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599980242] [2023-11-23 21:44:12,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:12,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:12,937 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:13,070 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2023-11-23 21:44:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 21:44:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:13,072 INFO L225 Difference]: With dead ends: 209 [2023-11-23 21:44:13,072 INFO L226 Difference]: Without dead ends: 208 [2023-11-23 21:44:13,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:13,074 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:13,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 162 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-23 21:44:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 136. [2023-11-23 21:44:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 81 states have (on average 1.9012345679012346) internal successors, (154), 134 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2023-11-23 21:44:13,083 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 7 [2023-11-23 21:44:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:13,083 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2023-11-23 21:44:13,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2023-11-23 21:44:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 21:44:13,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:13,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:13,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:44:13,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:13,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1758519726, now seen corresponding path program 1 times [2023-11-23 21:44:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43948076] [2023-11-23 21:44:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43948076] [2023-11-23 21:44:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43948076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:44:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216455116] [2023-11-23 21:44:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:13,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:13,143 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-23 21:44:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:13,187 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2023-11-23 21:44:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-23 21:44:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:13,189 INFO L225 Difference]: With dead ends: 142 [2023-11-23 21:44:13,189 INFO L226 Difference]: Without dead ends: 142 [2023-11-23 21:44:13,190 INFO L412 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 [2023-11-23 21:44:13,191 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:13,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 226 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:44:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-23 21:44:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-11-23 21:44:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.8588235294117648) internal successors, (158), 138 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2023-11-23 21:44:13,198 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 8 [2023-11-23 21:44:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:13,198 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2023-11-23 21:44:13,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-23 21:44:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2023-11-23 21:44:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 21:44:13,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:13,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:13,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:44:13,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:13,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1972424933, now seen corresponding path program 1 times [2023-11-23 21:44:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376353242] [2023-11-23 21:44:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376353242] [2023-11-23 21:44:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376353242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:44:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604586753] [2023-11-23 21:44:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:13,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:44:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:44:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:44:13,273 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:13,333 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2023-11-23 21:44:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:44:13,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 21:44:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:13,335 INFO L225 Difference]: With dead ends: 144 [2023-11-23 21:44:13,335 INFO L226 Difference]: Without dead ends: 141 [2023-11-23 21:44:13,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:44:13,336 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:13,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 338 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-23 21:44:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-11-23 21:44:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.8780487804878048) internal successors, (154), 135 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2023-11-23 21:44:13,342 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 11 [2023-11-23 21:44:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:13,343 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2023-11-23 21:44:13,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2023-11-23 21:44:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:44:13,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:13,344 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:13,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:44:13,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:13,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1548549347, now seen corresponding path program 1 times [2023-11-23 21:44:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349565643] [2023-11-23 21:44:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349565643] [2023-11-23 21:44:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349565643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:44:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702137259] [2023-11-23 21:44:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:13,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:13,402 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-23 21:44:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:13,476 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-11-23 21:44:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-11-23 21:44:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:13,478 INFO L225 Difference]: With dead ends: 145 [2023-11-23 21:44:13,478 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 21:44:13,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:13,479 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:13,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 201 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 21:44:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2023-11-23 21:44:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.8658536585365855) internal successors, (153), 135 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2023-11-23 21:44:13,485 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 15 [2023-11-23 21:44:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:13,485 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2023-11-23 21:44:13,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-23 21:44:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2023-11-23 21:44:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:44:13,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:13,488 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:13,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:44:13,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:13,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash -758529736, now seen corresponding path program 1 times [2023-11-23 21:44:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880481214] [2023-11-23 21:44:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:13,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:44:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880481214] [2023-11-23 21:44:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880481214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:13,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:13,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:44:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165769613] [2023-11-23 21:44:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:13,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:13,741 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-23 21:44:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:13,951 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-23 21:44:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:44:13,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2023-11-23 21:44:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:13,953 INFO L225 Difference]: With dead ends: 136 [2023-11-23 21:44:13,953 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 21:44:13,954 INFO L412 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 [2023-11-23 21:44:13,957 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:13,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 21:44:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 21:44:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 82 states have (on average 1.8414634146341464) internal successors, (151), 134 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2023-11-23 21:44:13,968 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 16 [2023-11-23 21:44:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:13,969 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2023-11-23 21:44:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-23 21:44:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2023-11-23 21:44:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:44:13,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:13,970 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:44:13,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:13,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -758529735, now seen corresponding path program 1 times [2023-11-23 21:44:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376227790] [2023-11-23 21:44:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:44:14,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376227790] [2023-11-23 21:44:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376227790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:44:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846013] [2023-11-23 21:44:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:14,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:14,233 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-23 21:44:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:14,442 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2023-11-23 21:44:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:44:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2023-11-23 21:44:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:14,444 INFO L225 Difference]: With dead ends: 135 [2023-11-23 21:44:14,444 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 21:44:14,445 INFO L412 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 [2023-11-23 21:44:14,446 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 329 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 21:44:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-23 21:44:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 133 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2023-11-23 21:44:14,451 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 16 [2023-11-23 21:44:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:14,451 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2023-11-23 21:44:14,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-23 21:44:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2023-11-23 21:44:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:44:14,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:14,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:14,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:44:14,453 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:14,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:14,453 INFO L85 PathProgramCache]: Analyzing trace with hash -738754375, now seen corresponding path program 1 times [2023-11-23 21:44:14,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839157535] [2023-11-23 21:44:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839157535] [2023-11-23 21:44:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839157535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664088715] [2023-11-23 21:44:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:14,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:14,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:14,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:14,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:44:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:14,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 21:44:14,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:14,800 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 [2023-11-23 21:44:14,855 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 21:44:14,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-11-23 21:44:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:14,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664088715] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:14,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:14,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-11-23 21:44:14,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088486192] [2023-11-23 21:44:14,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:14,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:14,966 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-23 21:44:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:15,167 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2023-11-23 21:44:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:44:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 16 [2023-11-23 21:44:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:15,169 INFO L225 Difference]: With dead ends: 136 [2023-11-23 21:44:15,170 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 21:44:15,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:44:15,171 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:15,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 266 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 21:44:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2023-11-23 21:44:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.8048780487804879) internal successors, (148), 132 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2023-11-23 21:44:15,176 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 16 [2023-11-23 21:44:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:15,176 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2023-11-23 21:44:15,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-23 21:44:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2023-11-23 21:44:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:44:15,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:15,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:15,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:44:15,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:15,401 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:15,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -738754374, now seen corresponding path program 1 times [2023-11-23 21:44:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272590758] [2023-11-23 21:44:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272590758] [2023-11-23 21:44:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272590758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234561417] [2023-11-23 21:44:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:15,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:15,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:15,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:15,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:44:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:15,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-23 21:44:15,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:15,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 21:44:15,832 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 [2023-11-23 21:44:15,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:15,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-23 21:44:15,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:44:15,975 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 [2023-11-23 21:44:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:16,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234561417] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:16,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-23 21:44:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363678458] [2023-11-23 21:44:16,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:16,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:44:16,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:44:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:44:16,375 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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) [2023-11-23 21:44:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:16,870 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2023-11-23 21:44:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:44:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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 16 [2023-11-23 21:44:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:16,872 INFO L225 Difference]: With dead ends: 141 [2023-11-23 21:44:16,872 INFO L226 Difference]: Without dead ends: 141 [2023-11-23 21:44:16,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:44:16,873 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 189 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:16,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 482 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:44:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-23 21:44:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2023-11-23 21:44:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 131 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2023-11-23 21:44:16,878 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 16 [2023-11-23 21:44:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:16,878 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2023-11-23 21:44:16,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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) [2023-11-23 21:44:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2023-11-23 21:44:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:44:16,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:16,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:16,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:44:17,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 21:44:17,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:17,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1197578905, now seen corresponding path program 1 times [2023-11-23 21:44:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157065618] [2023-11-23 21:44:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157065618] [2023-11-23 21:44:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157065618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:17,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:44:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052307929] [2023-11-23 21:44:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:44:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:44:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:44:17,345 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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) [2023-11-23 21:44:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:17,651 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2023-11-23 21:44:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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 [2023-11-23 21:44:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:17,652 INFO L225 Difference]: With dead ends: 134 [2023-11-23 21:44:17,653 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 21:44:17,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:44:17,654 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:17,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 412 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 21:44:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-11-23 21:44:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 131 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2023-11-23 21:44:17,660 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 18 [2023-11-23 21:44:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:17,662 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2023-11-23 21:44:17,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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) [2023-11-23 21:44:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2023-11-23 21:44:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:44:17,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:17,664 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:17,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:44:17,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:17,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1197578906, now seen corresponding path program 1 times [2023-11-23 21:44:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851187496] [2023-11-23 21:44:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851187496] [2023-11-23 21:44:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851187496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:44:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600149124] [2023-11-23 21:44:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:44:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:44:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:44:18,141 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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) [2023-11-23 21:44:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:18,532 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2023-11-23 21:44:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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 [2023-11-23 21:44:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:18,534 INFO L225 Difference]: With dead ends: 133 [2023-11-23 21:44:18,534 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 21:44:18,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:44:18,535 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:18,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 495 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 21:44:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 21:44:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 131 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2023-11-23 21:44:18,541 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 18 [2023-11-23 21:44:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:18,541 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2023-11-23 21:44:18,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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) [2023-11-23 21:44:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2023-11-23 21:44:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:44:18,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:18,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:18,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:44:18,543 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:18,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash -177698284, now seen corresponding path program 1 times [2023-11-23 21:44:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267382600] [2023-11-23 21:44:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:18,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267382600] [2023-11-23 21:44:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267382600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:44:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823282311] [2023-11-23 21:44:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:18,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:44:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:44:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:44:18,899 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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) [2023-11-23 21:44:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:19,259 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-11-23 21:44:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:44:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 [2023-11-23 21:44:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:19,260 INFO L225 Difference]: With dead ends: 134 [2023-11-23 21:44:19,260 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 21:44:19,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:44:19,261 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:19,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 475 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 21:44:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-11-23 21:44:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7560975609756098) internal successors, (144), 131 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2023-11-23 21:44:19,269 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 20 [2023-11-23 21:44:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:19,269 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2023-11-23 21:44:19,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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) [2023-11-23 21:44:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2023-11-23 21:44:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:44:19,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:19,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:44:19,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:19,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -177698283, now seen corresponding path program 1 times [2023-11-23 21:44:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576852140] [2023-11-23 21:44:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576852140] [2023-11-23 21:44:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576852140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:44:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089789541] [2023-11-23 21:44:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:44:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:44:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:44:19,828 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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) [2023-11-23 21:44:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:20,141 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2023-11-23 21:44:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:44:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 [2023-11-23 21:44:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:20,142 INFO L225 Difference]: With dead ends: 133 [2023-11-23 21:44:20,142 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 21:44:20,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:44:20,143 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:20,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 359 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:44:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 21:44:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 21:44:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7439024390243902) internal successors, (143), 131 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2023-11-23 21:44:20,148 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 20 [2023-11-23 21:44:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:20,148 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2023-11-23 21:44:20,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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) [2023-11-23 21:44:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2023-11-23 21:44:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:44:20,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:20,149 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:20,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:44:20,150 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:20,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1030844713, now seen corresponding path program 1 times [2023-11-23 21:44:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564920444] [2023-11-23 21:44:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564920444] [2023-11-23 21:44:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564920444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:20,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:20,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:44:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228978060] [2023-11-23 21:44:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:20,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:44:20,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:20,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:44:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:44:20,504 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2023-11-23 21:44:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:20,916 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2023-11-23 21:44:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:44:20,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 22 [2023-11-23 21:44:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:20,917 INFO L225 Difference]: With dead ends: 134 [2023-11-23 21:44:20,918 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 21:44:20,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:44:20,919 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:20,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 473 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 21:44:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-11-23 21:44:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-11-23 21:44:20,924 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2023-11-23 21:44:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:20,924 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-11-23 21:44:20,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2023-11-23 21:44:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-11-23 21:44:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:44:20,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:20,926 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:20,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:44:20,926 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:20,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1030844714, now seen corresponding path program 1 times [2023-11-23 21:44:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655766017] [2023-11-23 21:44:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655766017] [2023-11-23 21:44:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655766017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:44:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814554089] [2023-11-23 21:44:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:21,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:44:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:44:21,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:44:21,462 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2023-11-23 21:44:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:21,922 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2023-11-23 21:44:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:44:21,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 22 [2023-11-23 21:44:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:21,924 INFO L225 Difference]: With dead ends: 133 [2023-11-23 21:44:21,924 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 21:44:21,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:44:21,925 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:21,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 495 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 21:44:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 21:44:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 131 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-11-23 21:44:21,930 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 22 [2023-11-23 21:44:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:21,930 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-11-23 21:44:21,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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) [2023-11-23 21:44:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-11-23 21:44:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 21:44:21,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:21,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:21,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:44:21,932 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:21,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 885047130, now seen corresponding path program 1 times [2023-11-23 21:44:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253844638] [2023-11-23 21:44:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253844638] [2023-11-23 21:44:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253844638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195191534] [2023-11-23 21:44:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:22,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:22,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:22,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:22,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:44:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:23,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 21:44:23,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:23,088 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 [2023-11-23 21:44:23,145 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 [2023-11-23 21:44:23,156 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 [2023-11-23 21:44:23,221 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 29 treesize of output 13 [2023-11-23 21:44:23,230 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 29 treesize of output 13 [2023-11-23 21:44:23,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:44:23,282 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 [2023-11-23 21:44:23,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 21:44:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 21:44:23,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:23,496 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-23 21:44:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 49 [2023-11-23 21:44:23,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-11-23 21:44:23,751 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:23,754 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 61 treesize of output 54 [2023-11-23 21:44:23,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2023-11-23 21:44:23,796 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 5 treesize of output 3 [2023-11-23 21:44:23,886 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:23,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:23,897 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 33 treesize of output 18 [2023-11-23 21:44:23,984 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:23,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:23,997 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 33 treesize of output 18 [2023-11-23 21:44:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:24,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:24,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2023-11-23 21:44:24,069 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2023-11-23 21:44:24,086 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_604) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_605))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2023-11-23 21:44:24,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| .cse1)) (.cse7 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16| Int)) (or (< .cse0 |v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16|) (forall ((v_ArrVal_599 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 (store .cse6 |v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16| v_ArrVal_599)))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse4 (store .cse5 .cse2 v_ArrVal_602))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16| 0)) .cse2 v_ArrVal_603) .cse3 v_ArrVal_604) (select (select (store .cse4 .cse3 v_ArrVal_605) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse7) 0)))) (forall ((|v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16| Int)) (or (< .cse0 |v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16|) (forall ((v_ArrVal_599 Int) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse1 (store .cse6 |v_ULTIMATE.start_create_tree_#t~mem12#1.offset_16| v_ArrVal_599)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_602)))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_605)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse7) 0))))))) is different from false [2023-11-23 21:44:26,979 INFO L349 Elim1Store]: treesize reduction 53, result has 57.3 percent of original size [2023-11-23 21:44:26,979 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 4 case distinctions, treesize of input 410 treesize of output 437 [2023-11-23 21:44:27,130 INFO L349 Elim1Store]: treesize reduction 53, result has 65.1 percent of original size [2023-11-23 21:44:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 288 treesize of output 214 [2023-11-23 21:44:27,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:27,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 870 treesize of output 705 [2023-11-23 21:44:27,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:27,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1814 treesize of output 1751 [2023-11-23 21:44:27,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 176 [2023-11-23 21:44:27,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 164 [2023-11-23 21:44:27,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 152 [2023-11-23 21:44:27,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2023-11-23 21:44:27,632 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 144 treesize of output 136 [2023-11-23 21:44:28,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:28,053 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 27 treesize of output 19 [2023-11-23 21:44:28,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:44:28,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:28,076 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 3 case distinctions, treesize of input 114 treesize of output 71 [2023-11-23 21:44:28,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:28,100 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 1630 treesize of output 1200 [2023-11-23 21:44:28,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:28,132 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 83 treesize of output 69 [2023-11-23 21:44:28,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:28,142 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 69 treesize of output 55 [2023-11-23 21:44:28,147 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 55 treesize of output 51 [2023-11-23 21:44:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:28,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195191534] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:28,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:28,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 33 [2023-11-23 21:44:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273877366] [2023-11-23 21:44:28,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:28,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 21:44:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 21:44:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=680, Unknown=68, NotChecked=236, Total=1122 [2023-11-23 21:44:28,303 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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) [2023-11-23 21:44:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:31,182 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-11-23 21:44:31,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:44:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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 25 [2023-11-23 21:44:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:31,185 INFO L225 Difference]: With dead ends: 152 [2023-11-23 21:44:31,185 INFO L226 Difference]: Without dead ends: 152 [2023-11-23 21:44:31,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=249, Invalid=1174, Unknown=75, NotChecked=308, Total=1806 [2023-11-23 21:44:31,187 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 23 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:31,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1706 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 729 Invalid, 0 Unknown, 259 Unchecked, 2.0s Time] [2023-11-23 21:44:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-23 21:44:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2023-11-23 21:44:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.606060606060606) internal successors, (159), 148 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2023-11-23 21:44:31,192 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 25 [2023-11-23 21:44:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:31,193 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2023-11-23 21:44:31,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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) [2023-11-23 21:44:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2023-11-23 21:44:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 21:44:31,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:31,194 INFO L195 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] [2023-11-23 21:44:31,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:44:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:31,396 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:31,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 126933455, now seen corresponding path program 1 times [2023-11-23 21:44:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174172105] [2023-11-23 21:44:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:44:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174172105] [2023-11-23 21:44:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174172105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:44:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312992942] [2023-11-23 21:44:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:31,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:31,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:31,508 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 5 states, 5 states have (on average 5.4) 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) [2023-11-23 21:44:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:31,625 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2023-11-23 21:44:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:44:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) 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 [2023-11-23 21:44:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:31,626 INFO L225 Difference]: With dead ends: 150 [2023-11-23 21:44:31,627 INFO L226 Difference]: Without dead ends: 150 [2023-11-23 21:44:31,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:44:31,627 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 116 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:31,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 300 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-23 21:44:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-23 21:44:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.5858585858585859) internal successors, (157), 148 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2023-11-23 21:44:31,633 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 27 [2023-11-23 21:44:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:31,635 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2023-11-23 21:44:31,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) 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) [2023-11-23 21:44:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2023-11-23 21:44:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 21:44:31,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:31,636 INFO L195 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] [2023-11-23 21:44:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 21:44:31,636 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:31,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1211760724, now seen corresponding path program 1 times [2023-11-23 21:44:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102887559] [2023-11-23 21:44:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:44:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102887559] [2023-11-23 21:44:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102887559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:44:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946227642] [2023-11-23 21:44:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:31,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:44:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:44:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:44:31,737 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:31,905 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2023-11-23 21:44:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-23 21:44:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:31,907 INFO L225 Difference]: With dead ends: 172 [2023-11-23 21:44:31,907 INFO L226 Difference]: Without dead ends: 172 [2023-11-23 21:44:31,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:44:31,910 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 164 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:31,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 339 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:44:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-23 21:44:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2023-11-23 21:44:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 100 states have (on average 1.57) internal successors, (157), 148 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2023-11-23 21:44:31,916 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 31 [2023-11-23 21:44:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:31,916 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2023-11-23 21:44:31,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2023-11-23 21:44:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 21:44:31,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:31,917 INFO L195 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] [2023-11-23 21:44:31,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 21:44:31,937 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:31,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1900513620, now seen corresponding path program 1 times [2023-11-23 21:44:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:31,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743752536] [2023-11-23 21:44:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743752536] [2023-11-23 21:44:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743752536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544993151] [2023-11-23 21:44:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:32,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:32,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:32,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:44:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:32,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 21:44:32,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:32,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:32,297 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 21:44:32,299 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 12 treesize of output 11 [2023-11-23 21:44:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544993151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:32,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2023-11-23 21:44:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857012355] [2023-11-23 21:44:32,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:32,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:44:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:32,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:44:32,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:44:32,309 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-23 21:44:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:32,585 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2023-11-23 21:44:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 30 [2023-11-23 21:44:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:32,589 INFO L225 Difference]: With dead ends: 186 [2023-11-23 21:44:32,589 INFO L226 Difference]: Without dead ends: 186 [2023-11-23 21:44:32,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:44:32,590 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 117 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:32,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 259 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-23 21:44:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 148. [2023-11-23 21:44:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 146 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2023-11-23 21:44:32,596 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 30 [2023-11-23 21:44:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:32,596 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2023-11-23 21:44:32,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-11-23 21:44:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2023-11-23 21:44:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 21:44:32,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:32,598 INFO L195 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] [2023-11-23 21:44:32,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:44:32,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:32,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:32,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1900513621, now seen corresponding path program 1 times [2023-11-23 21:44:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588049690] [2023-11-23 21:44:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588049690] [2023-11-23 21:44:33,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588049690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856519278] [2023-11-23 21:44:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:33,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:33,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 21:44:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:33,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-23 21:44:33,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:33,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:33,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:33,462 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 19 treesize of output 23 [2023-11-23 21:44:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856519278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:33,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-23 21:44:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228576199] [2023-11-23 21:44:33,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:33,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:44:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:44:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:44:33,604 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 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) [2023-11-23 21:44:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:34,040 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-11-23 21:44:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 21:44:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 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 30 [2023-11-23 21:44:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:34,042 INFO L225 Difference]: With dead ends: 162 [2023-11-23 21:44:34,042 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 21:44:34,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:44:34,043 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 204 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:34,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 422 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:44:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 21:44:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2023-11-23 21:44:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5247524752475248) internal successors, (154), 145 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2023-11-23 21:44:34,053 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 30 [2023-11-23 21:44:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:34,053 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2023-11-23 21:44:34,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 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) [2023-11-23 21:44:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2023-11-23 21:44:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 21:44:34,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:34,055 INFO L195 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] [2023-11-23 21:44:34,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 21:44:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:34,260 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:34,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1032492473, now seen corresponding path program 1 times [2023-11-23 21:44:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464268564] [2023-11-23 21:44:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:34,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:34,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464268564] [2023-11-23 21:44:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464268564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392102618] [2023-11-23 21:44:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:34,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:34,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:34,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 21:44:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:34,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-23 21:44:34,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:34,845 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-23 21:44:34,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-11-23 21:44:34,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 21:44:35,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:35,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 21:44:35,094 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2023-11-23 21:44:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 28 [2023-11-23 21:44:35,322 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-23 21:44:35,322 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 26 treesize of output 31 [2023-11-23 21:44:35,351 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2023-11-23 21:44:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 32 [2023-11-23 21:44:35,364 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 16 treesize of output 12 [2023-11-23 21:44:35,461 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 7 treesize of output 3 [2023-11-23 21:44:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:35,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:35,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:35,910 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 43 treesize of output 38 [2023-11-23 21:44:35,918 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 20 treesize of output 18 [2023-11-23 21:44:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392102618] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:38,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2023-11-23 21:44:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293876098] [2023-11-23 21:44:38,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 21:44:38,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:38,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 21:44:38,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2023-11-23 21:44:38,006 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 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) [2023-11-23 21:44:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:40,223 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2023-11-23 21:44:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 21:44:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 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 [2023-11-23 21:44:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:40,224 INFO L225 Difference]: With dead ends: 160 [2023-11-23 21:44:40,225 INFO L226 Difference]: Without dead ends: 160 [2023-11-23 21:44:40,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 21:44:40,226 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 481 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:40,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 397 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 21:44:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-23 21:44:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2023-11-23 21:44:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 154 states have internal predecessors, (168), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-11-23 21:44:40,231 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 32 [2023-11-23 21:44:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:40,231 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-11-23 21:44:40,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 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) [2023-11-23 21:44:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-11-23 21:44:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 21:44:40,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:40,232 INFO L195 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] [2023-11-23 21:44:40,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 21:44:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-23 21:44:40,448 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:40,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1942470881, now seen corresponding path program 1 times [2023-11-23 21:44:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388589915] [2023-11-23 21:44:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388589915] [2023-11-23 21:44:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388589915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664331467] [2023-11-23 21:44:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:41,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:41,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:41,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 21:44:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:41,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 21:44:41,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:41,258 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 [2023-11-23 21:44:41,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:44:41,368 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 [2023-11-23 21:44:41,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 21:44:41,511 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:41,512 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 25 treesize of output 26 [2023-11-23 21:44:41,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:41,581 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 34 treesize of output 33 [2023-11-23 21:44:41,696 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:41,696 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 34 treesize of output 33 [2023-11-23 21:44:41,764 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:41,764 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 34 treesize of output 33 [2023-11-23 21:44:41,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 21:44:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:41,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:42,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_24| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1138))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1139)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_24|)) 1) (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_24|) (< |v_ULTIMATE.start_inspect_~node#1.offset_24| 0))) is different from false [2023-11-23 21:44:42,625 INFO L349 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2023-11-23 21:44:42,626 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 49 treesize of output 48 [2023-11-23 21:44:42,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_24| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_24|) (< |v_ULTIMATE.start_inspect_~node#1.offset_24| 0) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_1137))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1139)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_24|) |c_ULTIMATE.start_create_tree_#t~mem13#1.base|))) is different from false [2023-11-23 21:44:42,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_24| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_24|) (< |v_ULTIMATE.start_inspect_~node#1.offset_24| 0) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1137))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1139)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_24|) .cse2)))) is different from false [2023-11-23 21:44:42,831 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_24| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_24|) (< |v_ULTIMATE.start_inspect_~node#1.offset_24| 0) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1136))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse2 .cse3 v_ArrVal_1137))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1139)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_24|) .cse3))))) is different from false [2023-11-23 21:44:42,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:42,858 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 159 treesize of output 96 [2023-11-23 21:44:42,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:42,935 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 1021158 treesize of output 933293 [2023-11-23 21:44:44,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:44,729 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 1076 treesize of output 955 [2023-11-23 21:44:44,754 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 970 treesize of output 922 [2023-11-23 21:44:44,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:44,786 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 900 treesize of output 841 [2023-11-23 21:44:44,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:44,827 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 832 treesize of output 741 [2023-11-23 21:44:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664331467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:44:46,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:44:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 17] total 41 [2023-11-23 21:44:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028429804] [2023-11-23 21:44:46,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:44:46,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 21:44:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:46,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 21:44:46,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1242, Unknown=54, NotChecked=300, Total=1722 [2023-11-23 21:44:46,501 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 42 states have internal predecessors, (91), 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) [2023-11-23 21:44:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:44:49,000 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2023-11-23 21:44:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 21:44:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 42 states have internal predecessors, (91), 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 [2023-11-23 21:44:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:44:49,003 INFO L225 Difference]: With dead ends: 243 [2023-11-23 21:44:49,003 INFO L226 Difference]: Without dead ends: 243 [2023-11-23 21:44:49,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=2209, Unknown=55, NotChecked=404, Total=2970 [2023-11-23 21:44:49,005 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 296 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-23 21:44:49,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1648 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1828 Invalid, 0 Unknown, 668 Unchecked, 1.7s Time] [2023-11-23 21:44:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-23 21:44:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 166. [2023-11-23 21:44:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 120 states have (on average 1.5083333333333333) internal successors, (181), 164 states have internal predecessors, (181), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2023-11-23 21:44:49,011 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 33 [2023-11-23 21:44:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:44:49,012 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2023-11-23 21:44:49,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 42 states have internal predecessors, (91), 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) [2023-11-23 21:44:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2023-11-23 21:44:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 21:44:49,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:44:49,013 INFO L195 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] [2023-11-23 21:44:49,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 21:44:49,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:49,232 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-11-23 21:44:49,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1942470882, now seen corresponding path program 1 times [2023-11-23 21:44:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219560248] [2023-11-23 21:44:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219560248] [2023-11-23 21:44:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219560248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:44:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640703699] [2023-11-23 21:44:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:50,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:44:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:50,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:44:50,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b478ca-0857-4f78-a273-2c3541fc85f1/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 21:44:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:50,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 21:44:50,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:44:50,591 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 [2023-11-23 21:44:50,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:44:50,713 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 [2023-11-23 21:44:50,720 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 [2023-11-23 21:44:50,773 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 11 treesize of output 7 [2023-11-23 21:44:50,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 21:44:50,950 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:50,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 21:44:51,053 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:51,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:51,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 21:44:51,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:51,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:51,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 21:44:51,272 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 21:44:51,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-23 21:44:51,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 21:44:51,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 21:44:51,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 21:44:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:44:51,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:44:52,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (< (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 15) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1255 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 13)))))) is different from false [2023-11-23 21:44:52,307 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1254))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1253) .cse0 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 15) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1253) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_1254) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 13)) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0)))) is different from false [2023-11-23 21:44:52,540 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_1251))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_1254))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_1252) .cse0 v_ArrVal_1253) .cse1 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 15) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))))))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_1251))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_1252) .cse4 v_ArrVal_1253) (select (select (store .cse5 .cse4 v_ArrVal_1254) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1255))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 13))))) is different from false [2023-11-23 21:44:52,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1251))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1254))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ 15 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1252) .cse1 v_ArrVal_1253) .cse2 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))))) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1251))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1252) .cse5 v_ArrVal_1253) (select (select (store .cse6 .cse5 v_ArrVal_1254) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1255))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 13)) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0))))) is different from false [2023-11-23 21:44:52,631 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (< 0 (+ 13 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1249))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_1251))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1250) .cse0 v_ArrVal_1252) .cse1 v_ArrVal_1253) (select (select (store .cse2 .cse1 v_ArrVal_1254) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1255))))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1249))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_1251))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1254))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ 15 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_1250) .cse4 v_ArrVal_1252) .cse5 v_ArrVal_1253) .cse6 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|)))))))))))) is different from false [2023-11-23 21:44:52,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1249))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1251))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1250) .cse1 v_ArrVal_1252) .cse2 v_ArrVal_1253) (select (select (store .cse3 .cse2 v_ArrVal_1254) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_1255))))) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 13)))) (forall ((|v_ULTIMATE.start_inspect_~node#1.offset_25| Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (< |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| |v_ULTIMATE.start_inspect_~node#1.offset_25|) (< |v_ULTIMATE.start_inspect_~node#1.offset_25| 0) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1249))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1251))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1254))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (< (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1250) .cse5 v_ArrVal_1252) .cse6 v_ArrVal_1253) .cse7 v_ArrVal_1255) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|) 15) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1256) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |v_ULTIMATE.start_inspect_~node#1.offset_25|))))))))))))) is different from false [2023-11-23 21:44:52,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:52,766 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 146 treesize of output 147 [2023-11-23 21:44:52,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:52,774 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 138 treesize of output 91 [2023-11-23 21:44:52,786 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 3398 treesize of output 2950 [2023-11-23 21:44:52,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:52,834 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 3994 treesize of output 3925 [2023-11-23 21:44:52,897 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 532 treesize of output 500 [2023-11-23 21:44:52,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 494 [2023-11-23 21:44:52,935 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 522 treesize of output 492 [2023-11-23 21:44:52,954 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 466 treesize of output 458 [2023-11-23 21:44:52,974 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 458 treesize of output 450 [2023-11-23 21:44:52,993 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 450 treesize of output 430 [2023-11-23 21:44:53,014 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 430 treesize of output 414 [2023-11-23 21:44:53,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:53,498 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 289 treesize of output 290 [2023-11-23 21:44:53,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:44:53,509 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 281 treesize of output 170 [2023-11-23 21:44:53,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:44:53,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:44:53,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:53,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:53,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15358 treesize of output 11314 [2023-11-23 21:44:53,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:44:53,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:53,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:53,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5976 treesize of output 5692 [2023-11-23 21:44:54,123 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 2980 treesize of output 2868 [2023-11-23 21:44:54,180 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 2868 treesize of output 2832 [2023-11-23 21:44:54,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:44:54,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2832 treesize of output 2680