./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:52:40,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:52:40,593 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:52:40,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:52:40,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:52:40,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:52:40,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:52:40,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:52:40,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:52:40,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:52:40,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:52:40,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:52:40,633 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:52:40,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:52:40,634 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:52:40,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:52:40,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:52:40,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:52:40,637 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:52:40,637 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:52:40,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:52:40,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:52:40,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:52:40,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:52:40,640 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:52:40,641 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:52:40,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:52:40,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:52:40,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:52:40,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:40,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:52:40,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:52:40,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:52:40,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:52:40,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:52:40,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:52:40,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:52:40,648 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:52:40,649 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_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/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_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2023-11-06 22:52:40,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:52:41,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:52:41,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:52:41,038 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:52:41,039 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:52:41,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2023-11-06 22:52:44,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:52:44,557 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:52:44,571 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2023-11-06 22:52:44,589 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/data/103d96cfe/c89a6374dd7548fbb6cf48fbadc9ba64/FLAG490eb3b08 [2023-11-06 22:52:44,835 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/data/103d96cfe/c89a6374dd7548fbb6cf48fbadc9ba64 [2023-11-06 22:52:44,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:52:44,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:52:44,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:44,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:52:44,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:52:44,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:44,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3a2616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44, skipping insertion in model container [2023-11-06 22:52:44,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:44,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:52:45,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:45,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:52:45,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:45,399 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:52:45,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45 WrapperNode [2023-11-06 22:52:45,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:45,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:45,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:52:45,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:52:45,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,450 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2023-11-06 22:52:45,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:45,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:52:45,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:52:45,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:52:45,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:52:45,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:52:45,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:52:45,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:52:45,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (1/1) ... [2023-11-06 22:52:45,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:45,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:52:45,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:52:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:52:45,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:52:45,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:52:45,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:52:45,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:52:45,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:52:45,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:52:45,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:52:45,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:52:45,599 INFO L130 BoogieDeclarations]: Found specification of procedure append [2023-11-06 22:52:45,600 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2023-11-06 22:52:45,749 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:52:45,751 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:52:46,349 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:52:46,357 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:52:46,357 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:52:46,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:46 BoogieIcfgContainer [2023-11-06 22:52:46,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:52:46,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:52:46,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:52:46,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:52:46,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:44" (1/3) ... [2023-11-06 22:52:46,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:46, skipping insertion in model container [2023-11-06 22:52:46,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:45" (2/3) ... [2023-11-06 22:52:46,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:46, skipping insertion in model container [2023-11-06 22:52:46,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:46" (3/3) ... [2023-11-06 22:52:46,373 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2023-11-06 22:52:46,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:52:46,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-06 22:52:46,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:52:46,448 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;@20933ea6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:52:46,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-06 22:52:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:52:46,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:46,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:52:46,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:46,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:52:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038474390] [2023-11-06 22:52:46,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,714 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-06 22:52:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038474390] [2023-11-06 22:52:46,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038474390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:46,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826731516] [2023-11-06 22:52:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:46,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:46,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:46,761 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:47,017 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2023-11-06 22:52:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:52:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:47,035 INFO L225 Difference]: With dead ends: 167 [2023-11-06 22:52:47,035 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:52:47,037 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-06 22:52:47,042 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:47,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 172 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:52:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2023-11-06 22:52:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2023-11-06 22:52:47,095 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2023-11-06 22:52:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:47,096 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2023-11-06 22:52:47,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2023-11-06 22:52:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:52:47,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:47,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:52:47,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:52:47,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:47,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:52:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777385279] [2023-11-06 22:52:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:47,188 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-06 22:52:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777385279] [2023-11-06 22:52:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777385279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991020898] [2023-11-06 22:52:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:47,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:47,193 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:47,357 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2023-11-06 22:52:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:47,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:52:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:47,361 INFO L225 Difference]: With dead ends: 126 [2023-11-06 22:52:47,361 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:52:47,362 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-06 22:52:47,366 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:47,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:52:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2023-11-06 22:52:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2023-11-06 22:52:47,390 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2023-11-06 22:52:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:47,392 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2023-11-06 22:52:47,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2023-11-06 22:52:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:52:47,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:47,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:52:47,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:52:47,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:47,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2023-11-06 22:52:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19583756] [2023-11-06 22:52:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:47,539 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-06 22:52:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:47,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19583756] [2023-11-06 22:52:47,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19583756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:47,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:47,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954202439] [2023-11-06 22:52:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:47,547 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 22:52:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:47,661 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2023-11-06 22:52:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-06 22:52:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:47,666 INFO L225 Difference]: With dead ends: 141 [2023-11-06 22:52:47,666 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 22:52:47,667 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-06 22:52:47,675 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:47,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 177 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 22:52:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2023-11-06 22:52:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 123 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2023-11-06 22:52:47,705 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2023-11-06 22:52:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:47,706 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2023-11-06 22:52:47,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 22:52:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2023-11-06 22:52:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:52:47,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:47,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:52:47,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:52:47,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:47,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2023-11-06 22:52:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478497222] [2023-11-06 22:52:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:47,811 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-06 22:52:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478497222] [2023-11-06 22:52:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478497222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969307602] [2023-11-06 22:52:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:47,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:47,815 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 22:52:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:47,928 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-11-06 22:52:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-06 22:52:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:47,930 INFO L225 Difference]: With dead ends: 127 [2023-11-06 22:52:47,930 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 22:52:47,930 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-06 22:52:47,943 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:47,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 22:52:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-11-06 22:52:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2023-11-06 22:52:47,957 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2023-11-06 22:52:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:47,958 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2023-11-06 22:52:47,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 22:52:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2023-11-06 22:52:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:52:47,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:47,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:52:47,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:47,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2023-11-06 22:52:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846028105] [2023-11-06 22:52:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:48,049 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-06 22:52:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846028105] [2023-11-06 22:52:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846028105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291818048] [2023-11-06 22:52:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:48,053 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-06 22:52:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:48,154 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2023-11-06 22:52:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2023-11-06 22:52:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:48,157 INFO L225 Difference]: With dead ends: 120 [2023-11-06 22:52:48,157 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:52:48,157 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-06 22:52:48,158 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:48,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 142 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:52:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:52:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2023-11-06 22:52:48,168 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2023-11-06 22:52:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:48,169 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2023-11-06 22:52:48,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-06 22:52:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2023-11-06 22:52:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:52:48,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:48,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:48,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:52:48,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:48,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2023-11-06 22:52:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330701825] [2023-11-06 22:52:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:48,371 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-06 22:52:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330701825] [2023-11-06 22:52:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330701825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351463689] [2023-11-06 22:52:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:48,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:48,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:48,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:48,375 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-06 22:52:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:48,459 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2023-11-06 22:52:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2023-11-06 22:52:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:48,463 INFO L225 Difference]: With dead ends: 115 [2023-11-06 22:52:48,464 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:52:48,468 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-06 22:52:48,469 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 38 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:48,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:52:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-06 22:52:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-11-06 22:52:48,494 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2023-11-06 22:52:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:48,498 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-11-06 22:52:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-06 22:52:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-11-06 22:52:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:52:48,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:48,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:52:48,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:48,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2023-11-06 22:52:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423254260] [2023-11-06 22:52:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:48,855 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-06 22:52:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423254260] [2023-11-06 22:52:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423254260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:52:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275458709] [2023-11-06 22:52:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:48,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:48,858 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:52:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:49,210 INFO L93 Difference]: Finished difference Result 226 states and 243 transitions. [2023-11-06 22:52:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:52:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2023-11-06 22:52:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:49,212 INFO L225 Difference]: With dead ends: 226 [2023-11-06 22:52:49,212 INFO L226 Difference]: Without dead ends: 226 [2023-11-06 22:52:49,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:49,213 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 185 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:49,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 293 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:52:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-06 22:52:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 150. [2023-11-06 22:52:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.6126126126126126) internal successors, (179), 145 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2023-11-06 22:52:49,228 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 13 [2023-11-06 22:52:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:49,229 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2023-11-06 22:52:49,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:52:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2023-11-06 22:52:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:52:49,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:49,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:52:49,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:49,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2023-11-06 22:52:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452161196] [2023-11-06 22:52:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,591 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-06 22:52:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452161196] [2023-11-06 22:52:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452161196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:52:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251187083] [2023-11-06 22:52:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:49,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:49,595 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:52:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:49,843 INFO L93 Difference]: Finished difference Result 176 states and 211 transitions. [2023-11-06 22:52:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:52:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2023-11-06 22:52:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:49,845 INFO L225 Difference]: With dead ends: 176 [2023-11-06 22:52:49,845 INFO L226 Difference]: Without dead ends: 176 [2023-11-06 22:52:49,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:52:49,846 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:49,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 326 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-06 22:52:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2023-11-06 22:52:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 133 states have (on average 1.5413533834586466) internal successors, (205), 168 states have internal predecessors, (205), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2023-11-06 22:52:49,854 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 13 [2023-11-06 22:52:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:49,855 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2023-11-06 22:52:49,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:52:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2023-11-06 22:52:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:52:49,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:49,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:49,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:52:49,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:49,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2023-11-06 22:52:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523600390] [2023-11-06 22:52:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:50,635 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-06 22:52:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523600390] [2023-11-06 22:52:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523600390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:50,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:50,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:52:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407566896] [2023-11-06 22:52:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:50,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:50,640 INFO L87 Difference]: Start difference. First operand 174 states and 211 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-06 22:52:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:50,941 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2023-11-06 22:52:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:52:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2023-11-06 22:52:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:50,946 INFO L225 Difference]: With dead ends: 176 [2023-11-06 22:52:50,946 INFO L226 Difference]: Without dead ends: 176 [2023-11-06 22:52:50,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:52:50,947 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 22 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:50,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 547 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-06 22:52:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2023-11-06 22:52:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 133 states have (on average 1.5338345864661653) internal successors, (204), 168 states have internal predecessors, (204), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2023-11-06 22:52:50,954 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 22 [2023-11-06 22:52:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:50,954 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2023-11-06 22:52:50,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-06 22:52:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2023-11-06 22:52:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:52:50,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:50,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:50,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:52:50,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:50,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2023-11-06 22:52:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071220632] [2023-11-06 22:52:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:51,681 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-06 22:52:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071220632] [2023-11-06 22:52:51,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071220632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:51,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:51,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:52:51,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827974875] [2023-11-06 22:52:51,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:51,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:52:51,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:51,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:52:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:52:51,684 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-06 22:52:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:51,964 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2023-11-06 22:52:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:52:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 24 [2023-11-06 22:52:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:51,969 INFO L225 Difference]: With dead ends: 166 [2023-11-06 22:52:51,969 INFO L226 Difference]: Without dead ends: 166 [2023-11-06 22:52:51,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:51,970 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 10 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:51,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 536 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-06 22:52:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-06 22:52:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.544) internal successors, (193), 160 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2023-11-06 22:52:51,977 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 24 [2023-11-06 22:52:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:51,977 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-11-06 22:52:51,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-06 22:52:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2023-11-06 22:52:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:52:51,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:51,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:51,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:52:51,980 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:51,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1779831779, now seen corresponding path program 1 times [2023-11-06 22:52:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947079482] [2023-11-06 22:52:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:52:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,092 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-06 22:52:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947079482] [2023-11-06 22:52:52,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947079482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:52,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:52,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:52:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107689485] [2023-11-06 22:52:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:52,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:52:52,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:52:52,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:52:52,095 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:52:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:52,211 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-11-06 22:52:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:52:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-06 22:52:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:52,214 INFO L225 Difference]: With dead ends: 157 [2023-11-06 22:52:52,215 INFO L226 Difference]: Without dead ends: 157 [2023-11-06 22:52:52,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-06 22:52:52,216 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 12 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:52,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 251 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-06 22:52:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2023-11-06 22:52:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 138 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2023-11-06 22:52:52,226 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 31 [2023-11-06 22:52:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:52,228 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2023-11-06 22:52:52,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:52:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2023-11-06 22:52:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:52:52,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:52,231 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:52,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:52:52,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:52,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2023-11-06 22:52:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661637727] [2023-11-06 22:52:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:52:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:52,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661637727] [2023-11-06 22:52:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661637727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347392622] [2023-11-06 22:52:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:52,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:52,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:52:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:53,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:52:53,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:53,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:53,368 INFO L351 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-06 22:52:53,385 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:52:53,386 INFO L351 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-06 22:52:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:53,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:53,834 INFO L351 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 47 treesize of output 43 [2023-11-06 22:52:53,856 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:52:53,857 INFO L351 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 46 treesize of output 64 [2023-11-06 22:52:54,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:52:54,088 INFO L351 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 25 treesize of output 29 [2023-11-06 22:52:54,231 INFO L322 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-06 22:52:54,231 INFO L351 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 24 treesize of output 37 [2023-11-06 22:52:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347392622] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:54,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:54,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2023-11-06 22:52:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914786944] [2023-11-06 22:52:54,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:54,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:52:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:52:54,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:52:54,281 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:52:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:55,178 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2023-11-06 22:52:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:52:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-06 22:52:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:55,180 INFO L225 Difference]: With dead ends: 181 [2023-11-06 22:52:55,180 INFO L226 Difference]: Without dead ends: 181 [2023-11-06 22:52:55,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:52:55,181 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 418 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:55,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 589 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:52:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-06 22:52:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 142. [2023-11-06 22:52:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 136 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2023-11-06 22:52:55,188 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 32 [2023-11-06 22:52:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:55,188 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2023-11-06 22:52:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:52:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2023-11-06 22:52:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:52:55,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:55,190 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:55,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:52:55,397 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:55,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2023-11-06 22:52:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102913239] [2023-11-06 22:52:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:52:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:55,816 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-06 22:52:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102913239] [2023-11-06 22:52:55,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102913239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236886352] [2023-11-06 22:52:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:55,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:55,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:55,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:55,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:52:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:55,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:52:55,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:56,002 INFO L351 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-06 22:52:56,032 WARN L861 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2023-11-06 22:52:56,084 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:52:56,084 INFO L351 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-06 22:52:56,114 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:52:56,115 INFO L351 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-06 22:52:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:52:56,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:56,333 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-06 22:52:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236886352] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:56,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 11 [2023-11-06 22:52:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886858083] [2023-11-06 22:52:56,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:52:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:52:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2023-11-06 22:52:56,338 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:52:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:56,858 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2023-11-06 22:52:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:52:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-11-06 22:52:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:56,860 INFO L225 Difference]: With dead ends: 180 [2023-11-06 22:52:56,860 INFO L226 Difference]: Without dead ends: 180 [2023-11-06 22:52:56,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=196, Unknown=1, NotChecked=30, Total=306 [2023-11-06 22:52:56,861 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 178 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:56,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 394 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2023-11-06 22:52:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-06 22:52:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 143. [2023-11-06 22:52:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 137 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:52:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2023-11-06 22:52:56,867 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 33 [2023-11-06 22:52:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:56,869 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2023-11-06 22:52:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:52:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2023-11-06 22:52:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:52:56,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:56,872 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:56,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:57,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:52:57,073 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:52:57,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2023-11-06 22:52:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452952816] [2023-11-06 22:52:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:52:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,591 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-06 22:52:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452952816] [2023-11-06 22:52:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452952816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747296302] [2023-11-06 22:52:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:57,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:57,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:57,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:52:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:52:57,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:57,808 INFO L351 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-06 22:52:57,815 INFO L351 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-06 22:52:57,886 WARN L861 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2023-11-06 22:52:58,026 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:52:58,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 22:52:58,043 INFO L351 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-06 22:52:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:58,229 INFO L351 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-06 22:52:58,244 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-06 22:52:58,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 22:52:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:52:58,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747296302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:58,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:52:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-11-06 22:52:58,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102399544] [2023-11-06 22:52:58,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:58,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:52:58,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:52:58,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2023-11-06 22:52:58,652 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:59,922 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2023-11-06 22:52:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:52:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-06 22:52:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:59,926 INFO L225 Difference]: With dead ends: 328 [2023-11-06 22:52:59,926 INFO L226 Difference]: Without dead ends: 328 [2023-11-06 22:52:59,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=532, Unknown=1, NotChecked=48, Total=702 [2023-11-06 22:52:59,927 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 328 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:59,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 665 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 870 Invalid, 0 Unknown, 266 Unchecked, 0.9s Time] [2023-11-06 22:52:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-06 22:52:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 237. [2023-11-06 22:52:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.38860103626943) internal successors, (268), 226 states have internal predecessors, (268), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-06 22:52:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 282 transitions. [2023-11-06 22:52:59,939 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 282 transitions. Word has length 33 [2023-11-06 22:52:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:59,940 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 282 transitions. [2023-11-06 22:52:59,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:52:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 282 transitions. [2023-11-06 22:52:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:52:59,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:59,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:59,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:00,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:53:00,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:53:00,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2023-11-06 22:53:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:00,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980283463] [2023-11-06 22:53:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:53:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980283463] [2023-11-06 22:53:02,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980283463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547074520] [2023-11-06 22:53:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:02,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:02,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:02,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:02,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:53:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:02,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-06 22:53:02,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:02,662 INFO L351 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-06 22:53:02,713 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:53:02,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:53:03,017 INFO L351 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-06 22:53:03,027 INFO L351 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-06 22:53:03,111 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:03,112 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-06 22:53:03,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:53:03,142 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:03,143 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-06 22:53:03,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:53:03,256 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:03,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:53:03,284 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:03,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:53:03,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:53:03,496 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:53:03,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2023-11-06 22:53:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:53:03,760 INFO L351 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 28 treesize of output 23 [2023-11-06 22:53:03,782 INFO L322 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-11-06 22:53:03,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-11-06 22:53:03,891 INFO L351 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 48 treesize of output 39 [2023-11-06 22:53:03,899 INFO L351 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 37 treesize of output 30 [2023-11-06 22:53:04,149 INFO L351 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 48 treesize of output 39 [2023-11-06 22:53:04,156 INFO L351 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 37 treesize of output 30 [2023-11-06 22:53:04,222 INFO L351 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 48 treesize of output 39 [2023-11-06 22:53:04,230 INFO L351 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 37 treesize of output 30 [2023-11-06 22:53:04,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:53:04,327 INFO L351 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 39 treesize of output 21 [2023-11-06 22:53:04,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:53:04,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:53:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:04,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:04,493 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_1084 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1084) c_append_~head.base) .cse0) 5))) (forall ((v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1084) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1085) c_append_~head.base) .cse0)))))) is different from false [2023-11-06 22:53:05,446 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,447 INFO L351 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 114 treesize of output 115 [2023-11-06 22:53:05,463 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,464 INFO L351 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 134 treesize of output 125 [2023-11-06 22:53:05,482 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,482 INFO L351 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 492 treesize of output 356 [2023-11-06 22:53:05,528 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 552 treesize of output 534 [2023-11-06 22:53:05,618 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 279 treesize of output 329 [2023-11-06 22:53:05,662 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:05,663 INFO L351 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 251 treesize of output 248 [2023-11-06 22:53:05,691 INFO L351 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 280 treesize of output 260 [2023-11-06 22:53:05,717 INFO L351 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 268 treesize of output 240 [2023-11-06 22:53:05,744 INFO L351 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 215 treesize of output 199 [2023-11-06 22:53:05,770 INFO L351 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 199 treesize of output 191 [2023-11-06 22:53:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547074520] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:08,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:53:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-11-06 22:53:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206989439] [2023-11-06 22:53:08,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:08,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:53:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:53:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1086, Unknown=2, NotChecked=66, Total=1260 [2023-11-06 22:53:08,263 INFO L87 Difference]: Start difference. First operand 237 states and 282 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:53:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:10,640 INFO L93 Difference]: Finished difference Result 286 states and 343 transitions. [2023-11-06 22:53:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:53:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-11-06 22:53:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:10,644 INFO L225 Difference]: With dead ends: 286 [2023-11-06 22:53:10,644 INFO L226 Difference]: Without dead ends: 286 [2023-11-06 22:53:10,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=246, Invalid=1736, Unknown=2, NotChecked=86, Total=2070 [2023-11-06 22:53:10,646 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 287 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:10,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1103 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:53:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-06 22:53:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 236. [2023-11-06 22:53:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 225 states have internal predecessors, (265), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-06 22:53:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 279 transitions. [2023-11-06 22:53:10,657 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 279 transitions. Word has length 41 [2023-11-06 22:53:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:10,658 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 279 transitions. [2023-11-06 22:53:10,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:53:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 279 transitions. [2023-11-06 22:53:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:53:10,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:10,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:10,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:10,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:53:10,870 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:53:10,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2023-11-06 22:53:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48206816] [2023-11-06 22:53:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:11,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:53:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:12,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:12,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48206816] [2023-11-06 22:53:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48206816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923664210] [2023-11-06 22:53:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:12,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:12,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:12,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:12,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:53:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:53:12,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:12,387 INFO L351 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-06 22:53:12,429 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:53:12,429 INFO L351 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-06 22:53:12,660 INFO L351 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-06 22:53:12,716 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:12,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-06 22:53:12,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:53:12,782 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:53:12,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:53:12,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:53:12,872 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:53:12,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2023-11-06 22:53:13,046 INFO L322 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2023-11-06 22:53:13,047 INFO L351 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 4 case distinctions, treesize of input 30 treesize of output 40 [2023-11-06 22:53:13,124 INFO L351 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 40 treesize of output 31 [2023-11-06 22:53:13,343 INFO L351 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 40 treesize of output 31 [2023-11-06 22:53:13,392 INFO L351 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 40 treesize of output 31 [2023-11-06 22:53:13,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:53:13,461 INFO L351 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 31 treesize of output 13 [2023-11-06 22:53:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:13,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:14,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:14,003 INFO L351 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 33 treesize of output 34 [2023-11-06 22:53:14,015 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:53:14,016 INFO L351 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 170 treesize of output 118 [2023-11-06 22:53:14,040 INFO L351 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 86 treesize of output 78 [2023-11-06 22:53:14,048 INFO L351 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 40 treesize of output 36 [2023-11-06 22:53:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923664210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:14,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:53:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-11-06 22:53:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553130731] [2023-11-06 22:53:14,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:14,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 22:53:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 22:53:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1001, Unknown=7, NotChecked=0, Total=1122 [2023-11-06 22:53:14,366 INFO L87 Difference]: Start difference. First operand 236 states and 279 transitions. Second operand has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 24 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:53:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:16,011 INFO L93 Difference]: Finished difference Result 285 states and 342 transitions. [2023-11-06 22:53:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:53:16,012 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 24 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-11-06 22:53:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:16,014 INFO L225 Difference]: With dead ends: 285 [2023-11-06 22:53:16,015 INFO L226 Difference]: Without dead ends: 285 [2023-11-06 22:53:16,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1614, Unknown=7, NotChecked=0, Total=1892 [2023-11-06 22:53:16,016 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 171 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:16,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1105 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:53:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-06 22:53:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2023-11-06 22:53:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 225 states have internal predecessors, (264), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-06 22:53:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 278 transitions. [2023-11-06 22:53:16,032 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 278 transitions. Word has length 41 [2023-11-06 22:53:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:16,033 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 278 transitions. [2023-11-06 22:53:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 24 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:53:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 278 transitions. [2023-11-06 22:53:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:53:16,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:16,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:16,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:16,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:53:16,252 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-06 22:53:16,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2023-11-06 22:53:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266465282] [2023-11-06 22:53:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:53:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266465282] [2023-11-06 22:53:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266465282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647231717] [2023-11-06 22:53:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:19,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:19,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:19,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ba72ac-62b1-4402-a596-42f3c8169a2f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:53:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:19,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 22:53:19,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:19,865 INFO L351 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-06 22:53:19,890 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:53:19,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 22:53:19,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:53:19,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:53:20,019 INFO L351 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 19 treesize of output 18 [2023-11-06 22:53:20,034 INFO L351 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 19 treesize of output 18 [2023-11-06 22:53:22,515 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_$Pointer$.offset| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_119| c_append_~node~0.base)))) (let ((.cse1 (@diff .cse0 |v_#memory_$Pointer$.offset_119|))) (and (= |v_#memory_$Pointer$.offset_119| (store .cse0 .cse1 (select |v_#memory_$Pointer$.offset_119| .cse1))) (= |c_append_#in~head.base| .cse1) (= (store |v_#memory_$Pointer$.offset_119| c_append_~node~0.base .cse2) |c_#memory_$Pointer$.offset|))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (and (= (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_119| c_append_~node~0.base)) |v_#memory_$Pointer$.offset_119|) (= (store |v_#memory_$Pointer$.offset_119| c_append_~node~0.base .cse2) |c_#memory_$Pointer$.offset|))))) (let ((.cse3 (select |c_#memory_$Pointer$.base| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (and (= (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_127| c_append_~node~0.base)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| c_append_~node~0.base .cse3)))) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_127| c_append_~node~0.base)))) (let ((.cse4 (@diff .cse5 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse4) (= (store .cse5 .cse4 (select |v_#memory_$Pointer$.base_127| .cse4)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| c_append_~node~0.base .cse3)))))))) (= (select |c_old(#valid)| c_append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| c_append_~node~0.base (select |c_#valid| c_append_~node~0.base)))) is different from false [2023-11-06 22:53:22,521 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_$Pointer$.offset| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_119| c_append_~node~0.base)))) (let ((.cse1 (@diff .cse0 |v_#memory_$Pointer$.offset_119|))) (and (= |v_#memory_$Pointer$.offset_119| (store .cse0 .cse1 (select |v_#memory_$Pointer$.offset_119| .cse1))) (= |c_append_#in~head.base| .cse1) (= (store |v_#memory_$Pointer$.offset_119| c_append_~node~0.base .cse2) |c_#memory_$Pointer$.offset|))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (and (= (store |c_old(#memory_$Pointer$.offset)| c_append_~node~0.base (select |v_#memory_$Pointer$.offset_119| c_append_~node~0.base)) |v_#memory_$Pointer$.offset_119|) (= (store |v_#memory_$Pointer$.offset_119| c_append_~node~0.base .cse2) |c_#memory_$Pointer$.offset|))))) (let ((.cse3 (select |c_#memory_$Pointer$.base| c_append_~node~0.base))) (or (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (and (= (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_127| c_append_~node~0.base)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| c_append_~node~0.base .cse3)))) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| c_append_~node~0.base (select |v_#memory_$Pointer$.base_127| c_append_~node~0.base)))) (let ((.cse4 (@diff .cse5 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse4) (= (store .cse5 .cse4 (select |v_#memory_$Pointer$.base_127| .cse4)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| c_append_~node~0.base .cse3)))))))) (= (select |c_old(#valid)| c_append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| c_append_~node~0.base (select |c_#valid| c_append_~node~0.base)))) is different from true [2023-11-06 22:53:23,756 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (append_~node~0.base Int)) (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_119| append_~node~0.base)))) (let ((.cse0 (@diff .cse3 |v_#memory_$Pointer$.offset_119|))) (and (= |c_append_#in~head.base| .cse0) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_127| append_~node~0.base)))) (let ((.cse1 (@diff .cse2 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse1) (= (store .cse2 .cse1 (select |v_#memory_$Pointer$.base_127| .cse1)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base))))))) (= (store .cse3 .cse0 (select |v_#memory_$Pointer$.offset_119| .cse0)) |v_#memory_$Pointer$.offset_119|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (append_~node~0.base Int)) (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_119| append_~node~0.base)))) (let ((.cse4 (@diff .cse5 |v_#memory_$Pointer$.offset_119|))) (and (= |c_append_#in~head.base| .cse4) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= (store .cse5 .cse4 (select |v_#memory_$Pointer$.offset_119| .cse4)) |v_#memory_$Pointer$.offset_119|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))))) (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_127| append_~node~0.base)))) (let ((.cse6 (@diff .cse7 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse6) (= (store .cse7 .cse6 (select |v_#memory_$Pointer$.base_127| .cse6)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base))))))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base)))))) is different from false [2023-11-06 22:53:25,774 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (append_~node~0.base Int)) (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_119| append_~node~0.base)))) (let ((.cse0 (@diff .cse3 |v_#memory_$Pointer$.offset_119|))) (and (= |c_append_#in~head.base| .cse0) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_127| append_~node~0.base)))) (let ((.cse1 (@diff .cse2 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse1) (= (store .cse2 .cse1 (select |v_#memory_$Pointer$.base_127| .cse1)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base))))))) (= (store .cse3 .cse0 (select |v_#memory_$Pointer$.offset_119| .cse0)) |v_#memory_$Pointer$.offset_119|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))))) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (append_~node~0.base Int)) (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |v_#memory_$Pointer$.offset_119| append_~node~0.base)))) (let ((.cse4 (@diff .cse5 |v_#memory_$Pointer$.offset_119|))) (and (= |c_append_#in~head.base| .cse4) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base)) |c_#memory_$Pointer$.base|) (= (store .cse5 .cse4 (select |v_#memory_$Pointer$.offset_119| .cse4)) |v_#memory_$Pointer$.offset_119|) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))))) (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (select |v_#memory_$Pointer$.base_127| append_~node~0.base)))) (let ((.cse6 (@diff .cse7 |v_#memory_$Pointer$.base_127|))) (and (= |c_append_#in~head.base| .cse6) (= (store .cse7 .cse6 (select |v_#memory_$Pointer$.base_127| .cse6)) |v_#memory_$Pointer$.base_127|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_127| append_~node~0.base (select |c_#memory_$Pointer$.base| append_~node~0.base))))))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (select |c_#memory_$Pointer$.offset| append_~node~0.base))) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base)))))) is different from true [2023-11-06 22:53:26,853 INFO L322 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-06 22:53:26,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 284 treesize of output 562 [2023-11-06 22:53:26,991 INFO L217 Elim1Store]: Index analysis took 101 ms [2023-11-06 22:53:29,634 INFO L322 Elim1Store]: treesize reduction 197, result has 9.2 percent of original size [2023-11-06 22:53:29,634 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 216 treesize of output 494 [2023-11-06 22:53:31,026 INFO L217 Elim1Store]: Index analysis took 1137 ms [2023-11-06 22:53:39,795 WARN L293 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 178 DAG size of output: 61 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:53:39,796 INFO L322 Elim1Store]: treesize reduction 428, result has 19.7 percent of original size [2023-11-06 22:53:39,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 144 treesize of output 322