./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:01:29,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:01:29,992 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 21:01:30,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:01:30,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:01:30,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:01:30,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:01:30,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:01:30,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:01:30,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:01:30,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:01:30,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:01:30,074 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:01:30,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:01:30,077 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:01:30,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:01:30,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:01:30,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:01:30,079 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 21:01:30,080 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 21:01:30,081 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 21:01:30,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:01:30,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 21:01:30,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:01:30,083 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:01:30,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:01:30,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:01:30,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:01:30,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:01:30,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:01:30,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:30,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:01:30,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:01:30,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:01:30,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:01:30,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:01:30,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:01:30,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:01:30,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:01:30,091 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_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/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_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2023-11-21 21:01:30,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:01:30,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:01:30,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:01:30,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:01:30,487 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:01:30,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-21 21:01:33,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:01:34,435 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:01:34,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-21 21:01:34,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/data/3c6cd5e49/0b26a1ea944847159584c47b7b7d20eb/FLAG8ccbbccbc [2023-11-21 21:01:34,481 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/data/3c6cd5e49/0b26a1ea944847159584c47b7b7d20eb [2023-11-21 21:01:34,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:01:34,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:01:34,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:34,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:01:34,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:01:34,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffd8c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34, skipping insertion in model container [2023-11-21 21:01:34,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:01:34,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:34,848 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:01:34,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:34,972 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:01:34,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34 WrapperNode [2023-11-21 21:01:34,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:34,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:34,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:01:34,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:01:34,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,055 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2023-11-21 21:01:35,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:35,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:01:35,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:01:35,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:01:35,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:01:35,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:01:35,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:01:35,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:01:35,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:35,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:35,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:35,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:35,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:01:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:01:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 21:01:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 21:01:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:01:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 21:01:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:01:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:01:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:01:35,327 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:01:35,330 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:01:35,671 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:01:35,747 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:01:35,747 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 21:01:35,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:35 BoogieIcfgContainer [2023-11-21 21:01:35,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:01:35,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:01:35,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:01:35,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:01:35,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:01:34" (1/3) ... [2023-11-21 21:01:35,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f0240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:35, skipping insertion in model container [2023-11-21 21:01:35,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (2/3) ... [2023-11-21 21:01:35,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f0240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:35, skipping insertion in model container [2023-11-21 21:01:35,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:35" (3/3) ... [2023-11-21 21:01:35,760 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2023-11-21 21:01:35,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:01:35,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-21 21:01:35,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:01:35,829 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;@77b013e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:01:35,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-21 21:01:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 40 states have (on average 2.3) internal successors, (92), 82 states have internal predecessors, (92), 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-21 21:01:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 21:01:35,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:35,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 21:01:35,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:35,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 197185826, now seen corresponding path program 1 times [2023-11-21 21:01:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737455559] [2023-11-21 21:01:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,196 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-21 21:01:36,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737455559] [2023-11-21 21:01:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737455559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043008480] [2023-11-21 21:01:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:36,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:36,280 INFO L87 Difference]: Start difference. First operand has 86 states, 40 states have (on average 2.3) internal successors, (92), 82 states have internal predecessors, (92), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 21:01:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:36,478 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-21 21:01:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:36,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-11-21 21:01:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:36,490 INFO L225 Difference]: With dead ends: 83 [2023-11-21 21:01:36,491 INFO L226 Difference]: Without dead ends: 81 [2023-11-21 21:01:36,493 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-21 21:01:36,500 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:36,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-21 21:01:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-21 21:01:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 77 states have internal predecessors, (82), 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-21 21:01:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-21 21:01:36,558 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2023-11-21 21:01:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:36,559 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-21 21:01:36,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 21:01:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-21 21:01:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 21:01:36,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:36,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 21:01:36,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:01:36,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:36,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 197185827, now seen corresponding path program 1 times [2023-11-21 21:01:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944575512] [2023-11-21 21:01:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,777 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-21 21:01:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944575512] [2023-11-21 21:01:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944575512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124211568] [2023-11-21 21:01:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:36,786 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 21:01:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:36,892 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-21 21:01:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-11-21 21:01:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:36,899 INFO L225 Difference]: With dead ends: 79 [2023-11-21 21:01:36,899 INFO L226 Difference]: Without dead ends: 79 [2023-11-21 21:01:36,900 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-21 21:01:36,901 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:36,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-21 21:01:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-21 21:01:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 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-21 21:01:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-21 21:01:36,926 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 5 [2023-11-21 21:01:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:36,927 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-21 21:01:36,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-21 21:01:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-21 21:01:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 21:01:36,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:36,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:36,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:01:36,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:36,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 868784147, now seen corresponding path program 1 times [2023-11-21 21:01:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719309166] [2023-11-21 21:01:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:37,060 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-21 21:01:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719309166] [2023-11-21 21:01:37,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719309166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:37,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:37,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:01:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024875559] [2023-11-21 21:01:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:37,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:01:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:01:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:01:37,064 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 21:01:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:37,204 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-21 21:01:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:01:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-21 21:01:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:37,209 INFO L225 Difference]: With dead ends: 80 [2023-11-21 21:01:37,213 INFO L226 Difference]: Without dead ends: 80 [2023-11-21 21:01:37,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-21 21:01:37,221 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:37,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-21 21:01:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-21 21:01:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.076923076923077) internal successors, (81), 76 states have internal predecessors, (81), 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-21 21:01:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-21 21:01:37,230 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 10 [2023-11-21 21:01:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:37,231 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-21 21:01:37,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 21:01:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-21 21:01:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 21:01:37,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:37,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:37,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:01:37,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:37,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 603951037, now seen corresponding path program 1 times [2023-11-21 21:01:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174528705] [2023-11-21 21:01:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 21:01:37,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174528705] [2023-11-21 21:01:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174528705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:37,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631748515] [2023-11-21 21:01:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:37,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:37,554 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:37,849 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-21 21:01:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:01:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-21 21:01:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:37,852 INFO L225 Difference]: With dead ends: 79 [2023-11-21 21:01:37,853 INFO L226 Difference]: Without dead ends: 79 [2023-11-21 21:01:37,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:37,864 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:37,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 224 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-21 21:01:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-21 21:01:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 2.051282051282051) internal successors, (80), 75 states have internal predecessors, (80), 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-21 21:01:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-21 21:01:37,882 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 17 [2023-11-21 21:01:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:37,884 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-21 21:01:37,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-21 21:01:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 21:01:37,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:37,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:37,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:01:37,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:37,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 603951038, now seen corresponding path program 1 times [2023-11-21 21:01:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494524255] [2023-11-21 21:01:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494524255] [2023-11-21 21:01:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494524255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026152198] [2023-11-21 21:01:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:38,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:38,249 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:38,475 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-21 21:01:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:01:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-21 21:01:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:38,477 INFO L225 Difference]: With dead ends: 78 [2023-11-21 21:01:38,478 INFO L226 Difference]: Without dead ends: 78 [2023-11-21 21:01:38,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:38,479 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:38,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:01:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-21 21:01:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-21 21:01:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 74 states have internal predecessors, (79), 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-21 21:01:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-21 21:01:38,501 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 17 [2023-11-21 21:01:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-21 21:01:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-21 21:01:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 21:01:38,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:38,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:38,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:01:38,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:38,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 576524929, now seen corresponding path program 1 times [2023-11-21 21:01:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180828978] [2023-11-21 21:01:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 21:01:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180828978] [2023-11-21 21:01:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180828978] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140118224] [2023-11-21 21:01:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:38,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:38,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:38,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 21:01:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-21 21:01:39,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:39,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:01:39,222 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 21:01:39,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-21 21:01:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:39,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140118224] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:01:39,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:01:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-21 21:01:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843101798] [2023-11-21 21:01:39,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:39,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-21 21:01:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-21 21:01:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-21 21:01:39,568 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-21 21:01:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:40,010 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-21 21:01:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:01:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-21 21:01:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:40,011 INFO L225 Difference]: With dead ends: 77 [2023-11-21 21:01:40,011 INFO L226 Difference]: Without dead ends: 77 [2023-11-21 21:01:40,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-21 21:01:40,013 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:40,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 415 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 21:01:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-21 21:01:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-21 21:01:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 2.0) internal successors, (78), 73 states have internal predecessors, (78), 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-21 21:01:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-21 21:01:40,018 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2023-11-21 21:01:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:40,018 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-21 21:01:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-21 21:01:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-21 21:01:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 21:01:40,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:40,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:40,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-21 21:01:40,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:40,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 576524930, now seen corresponding path program 1 times [2023-11-21 21:01:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917625450] [2023-11-21 21:01:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917625450] [2023-11-21 21:01:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917625450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603612296] [2023-11-21 21:01:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:40,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:40,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:01:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:40,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 21:01:40,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:40,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:01:40,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 21:01:41,100 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:01:41,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 21:01:41,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-21 21:01:41,180 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-21 21:01:41,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603612296] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:41,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-21 21:01:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883649033] [2023-11-21 21:01:41,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-21 21:01:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-21 21:01:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-21 21:01:41,342 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 21:01:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:41,935 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-11-21 21:01:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:01:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-21 21:01:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:41,936 INFO L225 Difference]: With dead ends: 78 [2023-11-21 21:01:41,936 INFO L226 Difference]: Without dead ends: 78 [2023-11-21 21:01:41,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-11-21 21:01:41,938 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:41,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 454 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 21:01:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-21 21:01:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-21 21:01:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 72 states have internal predecessors, (77), 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-21 21:01:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-21 21:01:41,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2023-11-21 21:01:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-21 21:01:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 21:01:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-21 21:01:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:01:41,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:41,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:41,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:42,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-21 21:01:42,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:42,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -10179111, now seen corresponding path program 1 times [2023-11-21 21:01:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669519710] [2023-11-21 21:01:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 21:01:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:42,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669519710] [2023-11-21 21:01:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669519710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675475215] [2023-11-21 21:01:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:42,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:42,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 21:01:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 21:01:42,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:42,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:01:42,771 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-21 21:01:42,840 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 21:01:42,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 21:01:42,921 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))) is different from false [2023-11-21 21:01:42,924 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))) is different from true [2023-11-21 21:01:42,942 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2023-11-21 21:01:42,944 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from true [2023-11-21 21:01:42,968 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) is different from false [2023-11-21 21:01:42,971 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) is different from true [2023-11-21 21:01:43,015 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) is different from false [2023-11-21 21:01:43,018 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) is different from true [2023-11-21 21:01:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-21 21:01:43,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675475215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:43,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-11-21 21:01:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569294635] [2023-11-21 21:01:43,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-21 21:01:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-21 21:01:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=244, Unknown=9, NotChecked=180, Total=506 [2023-11-21 21:01:43,282 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-21 21:01:43,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from false [2023-11-21 21:01:43,390 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from true [2023-11-21 21:01:43,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from false [2023-11-21 21:01:43,397 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from true [2023-11-21 21:01:43,401 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-21 21:01:43,403 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-21 21:01:43,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from false [2023-11-21 21:01:43,421 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from true [2023-11-21 21:01:43,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from false [2023-11-21 21:01:43,434 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from true [2023-11-21 21:01:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:43,796 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-21 21:01:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 21:01:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-21 21:01:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:43,797 INFO L225 Difference]: With dead ends: 125 [2023-11-21 21:01:43,798 INFO L226 Difference]: Without dead ends: 125 [2023-11-21 21:01:43,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=300, Unknown=19, NotChecked=450, Total=870 [2023-11-21 21:01:43,799 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 173 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 773 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:43,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 267 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 420 Invalid, 0 Unknown, 773 Unchecked, 0.4s Time] [2023-11-21 21:01:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-21 21:01:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2023-11-21 21:01:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 80 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2023-11-21 21:01:43,805 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 21 [2023-11-21 21:01:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:43,805 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2023-11-21 21:01:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-21 21:01:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2023-11-21 21:01:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:01:43,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:43,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:43,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:44,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-21 21:01:44,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:44,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -10179110, now seen corresponding path program 1 times [2023-11-21 21:01:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993593714] [2023-11-21 21:01:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993593714] [2023-11-21 21:01:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993593714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388961303] [2023-11-21 21:01:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 21:01:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-21 21:01:45,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:45,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 21:01:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 21:01:45,222 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-21 21:01:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:01:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-21 21:01:45,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 21:01:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:01:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-21 21:01:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:01:45,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388961303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:45,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2023-11-21 21:01:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052900831] [2023-11-21 21:01:45,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-21 21:01:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 21:01:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2023-11-21 21:01:45,559 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 16 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 21:01:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:46,113 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-11-21 21:01:46,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 21:01:46,114 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-21 21:01:46,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:46,115 INFO L225 Difference]: With dead ends: 77 [2023-11-21 21:01:46,116 INFO L226 Difference]: Without dead ends: 77 [2023-11-21 21:01:46,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=456, Unknown=1, NotChecked=44, Total=600 [2023-11-21 21:01:46,117 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 155 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:46,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 172 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 443 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2023-11-21 21:01:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-21 21:01:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-21 21:01:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.64) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-11-21 21:01:46,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 21 [2023-11-21 21:01:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:46,129 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-11-21 21:01:46,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 21:01:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-11-21 21:01:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:01:46,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:46,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:46,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:46,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 21:01:46,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:46,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -10174403, now seen corresponding path program 1 times [2023-11-21 21:01:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620624062] [2023-11-21 21:01:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 21:01:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620624062] [2023-11-21 21:01:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620624062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:01:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138001172] [2023-11-21 21:01:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:46,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:01:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:01:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:01:46,444 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:46,545 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2023-11-21 21:01:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:01:46,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-11-21 21:01:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:46,547 INFO L225 Difference]: With dead ends: 115 [2023-11-21 21:01:46,548 INFO L226 Difference]: Without dead ends: 115 [2023-11-21 21:01:46,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:01:46,549 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:46,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 131 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-21 21:01:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2023-11-21 21:01:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-21 21:01:46,555 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2023-11-21 21:01:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:46,556 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-21 21:01:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-21 21:01:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 21:01:46,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:46,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:01:46,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:46,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -315547993, now seen corresponding path program 1 times [2023-11-21 21:01:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448058493] [2023-11-21 21:01:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 21:01:46,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448058493] [2023-11-21 21:01:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448058493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:01:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090368811] [2023-11-21 21:01:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:46,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:01:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:01:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:01:46,798 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:47,182 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-21 21:01:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-21 21:01:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:47,183 INFO L225 Difference]: With dead ends: 105 [2023-11-21 21:01:47,183 INFO L226 Difference]: Without dead ends: 105 [2023-11-21 21:01:47,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:01:47,184 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 127 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:47,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 179 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-21 21:01:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2023-11-21 21:01:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-21 21:01:47,188 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 22 [2023-11-21 21:01:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-21 21:01:47,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-21 21:01:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 21:01:47,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:47,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:47,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:01:47,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:47,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -315547992, now seen corresponding path program 1 times [2023-11-21 21:01:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:47,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403810761] [2023-11-21 21:01:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:47,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403810761] [2023-11-21 21:01:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403810761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:01:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116702861] [2023-11-21 21:01:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:47,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:01:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:01:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:01:47,595 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:48,020 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-11-21 21:01:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-21 21:01:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:48,022 INFO L225 Difference]: With dead ends: 143 [2023-11-21 21:01:48,022 INFO L226 Difference]: Without dead ends: 143 [2023-11-21 21:01:48,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:01:48,023 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 182 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:48,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 244 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 21:01:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-21 21:01:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 85. [2023-11-21 21:01:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.55) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-11-21 21:01:48,027 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 22 [2023-11-21 21:01:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:48,028 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-11-21 21:01:48,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-11-21 21:01:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 21:01:48,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:48,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:48,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:01:48,029 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:48,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1192053173, now seen corresponding path program 1 times [2023-11-21 21:01:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212464665] [2023-11-21 21:01:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 21:01:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212464665] [2023-11-21 21:01:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212464665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:01:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585075237] [2023-11-21 21:01:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:48,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:01:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:01:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:01:48,118 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:48,209 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2023-11-21 21:01:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:01:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-21 21:01:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:48,211 INFO L225 Difference]: With dead ends: 84 [2023-11-21 21:01:48,211 INFO L226 Difference]: Without dead ends: 84 [2023-11-21 21:01:48,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-21 21:01:48,212 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:48,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-21 21:01:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2023-11-21 21:01:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 71 states have internal predecessors, (83), 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-21 21:01:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-21 21:01:48,218 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 23 [2023-11-21 21:01:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:48,220 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-21 21:01:48,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:01:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-21 21:01:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 21:01:48,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:48,223 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] [2023-11-21 21:01:48,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:01:48,224 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:48,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1666445042, now seen corresponding path program 1 times [2023-11-21 21:01:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174563916] [2023-11-21 21:01:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174563916] [2023-11-21 21:01:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174563916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071703627] [2023-11-21 21:01:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:48,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:48,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:48,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 21:01:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-21 21:01:49,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:49,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:01:49,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:01:49,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 21:01:49,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 21:01:49,369 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-21 21:01:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-21 21:01:49,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 21:01:49,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:01:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2023-11-21 21:01:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:49,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-11-21 21:01:49,624 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2023-11-21 21:01:49,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2023-11-21 21:01:49,632 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1000))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2023-11-21 21:01:49,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:49,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2023-11-21 21:01:49,703 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2023-11-21 21:01:49,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 131 [2023-11-21 21:01:49,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:49,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 100 [2023-11-21 21:01:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071703627] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:50,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2023-11-21 21:01:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836837007] [2023-11-21 21:01:50,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:50,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-21 21:01:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-21 21:01:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=739, Unknown=1, NotChecked=54, Total=870 [2023-11-21 21:01:50,236 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 21:01:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:51,257 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2023-11-21 21:01:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 21:01:51,258 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-21 21:01:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:51,261 INFO L225 Difference]: With dead ends: 144 [2023-11-21 21:01:51,261 INFO L226 Difference]: Without dead ends: 144 [2023-11-21 21:01:51,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=1193, Unknown=1, NotChecked=70, Total=1406 [2023-11-21 21:01:51,262 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 376 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:51,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 400 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-21 21:01:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-21 21:01:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2023-11-21 21:01:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 82 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:01:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2023-11-21 21:01:51,267 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 26 [2023-11-21 21:01:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:51,267 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2023-11-21 21:01:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 21:01:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2023-11-21 21:01:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 21:01:51,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:51,269 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] [2023-11-21 21:01:51,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:51,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:51,486 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:01:51,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1666445041, now seen corresponding path program 1 times [2023-11-21 21:01:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376481657] [2023-11-21 21:01:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:01:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376481657] [2023-11-21 21:01:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376481657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435768427] [2023-11-21 21:01:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:52,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:52,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:52,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:52,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 21:01:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-21 21:01:52,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:52,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:01:52,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:01:52,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 21:01:53,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 21:01:53,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 21:01:53,182 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-21 21:01:53,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 91 [2023-11-21 21:01:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 44 [2023-11-21 21:01:53,507 INFO L349 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-11-21 21:01:53,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 61 [2023-11-21 21:01:53,516 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 21:01:53,516 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-11-21 21:01:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:53,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:53,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2023-11-21 21:01:53,909 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1117) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1118 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1118))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse1 .cse0) .cse2)))))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1117 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1117))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_1118 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1118) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse4 .cse5) .cse3) 1)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_1117 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1117))) (let ((.cse6 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_1118 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1118) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (< (select (select .cse8 .cse7) .cse6) (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)))))))))) is different from false [2023-11-21 21:01:53,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:53,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 52 [2023-11-21 21:01:54,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:54,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 44 [2023-11-21 21:01:54,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:54,027 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 130 [2023-11-21 21:01:54,210 INFO L349 Elim1Store]: treesize reduction 140, result has 43.8 percent of original size [2023-11-21 21:01:54,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 214 treesize of output 264 [2023-11-21 21:01:54,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:54,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 128 [2023-11-21 21:01:54,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2023-11-21 21:01:57,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:57,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-21 21:01:57,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:57,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2023-11-21 21:01:57,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:01:57,474 INFO L349 Elim1Store]: treesize reduction 79, result has 28.8 percent of original size [2023-11-21 21:01:57,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 101 [2023-11-21 21:01:57,529 INFO L349 Elim1Store]: treesize reduction 4, result has 88.6 percent of original size [2023-11-21 21:01:57,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 53 treesize of output 69 [2023-11-21 21:01:57,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-11-21 21:01:57,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-21 21:01:57,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:57,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-21 21:01:57,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:57,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2023-11-21 21:01:57,728 INFO L349 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2023-11-21 21:01:57,740 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 88 [2023-11-21 21:01:57,947 INFO L349 Elim1Store]: treesize reduction 140, result has 43.8 percent of original size [2023-11-21 21:01:57,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 212 treesize of output 266 [2023-11-21 21:01:57,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 83 [2023-11-21 21:01:58,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:01:58,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 128 [2023-11-21 21:01:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435768427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:59,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-11-21 21:01:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358390873] [2023-11-21 21:01:59,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-21 21:01:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-21 21:01:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1312, Unknown=1, NotChecked=72, Total=1482 [2023-11-21 21:01:59,203 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 21:02:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:01,466 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2023-11-21 21:02:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 21:02:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-21 21:02:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:01,469 INFO L225 Difference]: With dead ends: 182 [2023-11-21 21:02:01,469 INFO L226 Difference]: Without dead ends: 182 [2023-11-21 21:02:01,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=231, Invalid=2528, Unknown=1, NotChecked=102, Total=2862 [2023-11-21 21:02:01,473 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 778 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:01,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 612 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-21 21:02:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-21 21:02:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 84. [2023-11-21 21:02:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 79 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:02:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2023-11-21 21:02:01,478 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 26 [2023-11-21 21:02:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:01,478 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2023-11-21 21:02:01,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 21:02:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2023-11-21 21:02:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 21:02:01,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:01,482 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] [2023-11-21 21:02:01,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 21:02:01,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-21 21:02:01,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:02:01,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 564032200, now seen corresponding path program 1 times [2023-11-21 21:02:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082247148] [2023-11-21 21:02:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:02:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:02:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 21:02:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082247148] [2023-11-21 21:02:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082247148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:01,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:01,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:02:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192368844] [2023-11-21 21:02:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:01,865 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:02,008 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2023-11-21 21:02:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-21 21:02:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:02,009 INFO L225 Difference]: With dead ends: 106 [2023-11-21 21:02:02,009 INFO L226 Difference]: Without dead ends: 106 [2023-11-21 21:02:02,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:02,010 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:02,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:02:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-21 21:02:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2023-11-21 21:02:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 85 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:02:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2023-11-21 21:02:02,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 28 [2023-11-21 21:02:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:02,015 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2023-11-21 21:02:02,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2023-11-21 21:02:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 21:02:02,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:02,015 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] [2023-11-21 21:02:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:02:02,016 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:02:02,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash 564015347, now seen corresponding path program 1 times [2023-11-21 21:02:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:02,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700598932] [2023-11-21 21:02:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:02:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:02:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:02:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700598932] [2023-11-21 21:02:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700598932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:02,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:02,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:02:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290177621] [2023-11-21 21:02:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:02,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:02:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:02:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:02:02,252 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:02,533 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2023-11-21 21:02:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 21:02:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-21 21:02:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:02,535 INFO L225 Difference]: With dead ends: 140 [2023-11-21 21:02:02,535 INFO L226 Difference]: Without dead ends: 140 [2023-11-21 21:02:02,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:02:02,536 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 86 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:02,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 340 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-21 21:02:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 109. [2023-11-21 21:02:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 104 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:02:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2023-11-21 21:02:02,541 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 28 [2023-11-21 21:02:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:02,541 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2023-11-21 21:02:02,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2023-11-21 21:02:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 21:02:02,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:02,542 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] [2023-11-21 21:02:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:02:02,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:02:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 304606678, now seen corresponding path program 1 times [2023-11-21 21:02:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703302333] [2023-11-21 21:02:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:02:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:02:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:02:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:02,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703302333] [2023-11-21 21:02:02,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703302333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:02,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:02,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:02:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984491649] [2023-11-21 21:02:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:02,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:02:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:02:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:02:02,822 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:03,207 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2023-11-21 21:02:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 21:02:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-21 21:02:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:03,209 INFO L225 Difference]: With dead ends: 146 [2023-11-21 21:02:03,209 INFO L226 Difference]: Without dead ends: 146 [2023-11-21 21:02:03,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:02:03,210 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 71 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:03,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 296 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:02:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-21 21:02:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2023-11-21 21:02:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.5252525252525253) internal successors, (151), 117 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:02:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2023-11-21 21:02:03,216 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 29 [2023-11-21 21:02:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:03,216 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2023-11-21 21:02:03,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2023-11-21 21:02:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-21 21:02:03,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:03,218 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] [2023-11-21 21:02:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:02:03,218 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:02:03,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 852872533, now seen corresponding path program 1 times [2023-11-21 21:02:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804152213] [2023-11-21 21:02:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:02:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:02:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 21:02:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804152213] [2023-11-21 21:02:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804152213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:02:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797902239] [2023-11-21 21:02:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:03,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:02:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:02:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:02:03,508 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:03,852 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2023-11-21 21:02:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 21:02:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-21 21:02:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:03,854 INFO L225 Difference]: With dead ends: 138 [2023-11-21 21:02:03,854 INFO L226 Difference]: Without dead ends: 138 [2023-11-21 21:02:03,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:02:03,855 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:03,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 248 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:02:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-21 21:02:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2023-11-21 21:02:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.52) internal successors, (152), 118 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 21:02:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2023-11-21 21:02:03,861 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 30 [2023-11-21 21:02:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:03,861 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2023-11-21 21:02:03,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-21 21:02:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2023-11-21 21:02:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-21 21:02:03,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:03,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:03,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 21:02:03,862 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-21 21:02:03,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1460238325, now seen corresponding path program 2 times [2023-11-21 21:02:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431608707] [2023-11-21 21:02:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:04,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:02:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:02:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:02:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431608707] [2023-11-21 21:02:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431608707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:02:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559897707] [2023-11-21 21:02:05,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:02:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:02:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:02:05,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:02:05,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad17eb57-a6dc-4edb-8076-3170414b7ad2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 21:02:05,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:02:05,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:02:05,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-21 21:02:05,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:02:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:02:05,688 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 21:02:05,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 21:02:05,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 21:02:05,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 21:02:05,985 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2023-11-21 21:02:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 51 [2023-11-21 21:02:05,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2023-11-21 21:02:06,444 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-21 21:02:06,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 69 [2023-11-21 21:02:06,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:02:06,761 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:02:06,780 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2023-11-21 21:02:06,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 39 [2023-11-21 21:02:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:06,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:02:07,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:02:07,835 INFO L349 Elim1Store]: treesize reduction 104, result has 70.9 percent of original size [2023-11-21 21:02:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 5847 treesize of output 5071 [2023-11-21 21:02:08,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:02:08,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3386 treesize of output 2570 [2023-11-21 21:02:08,990 INFO L349 Elim1Store]: treesize reduction 78, result has 65.9 percent of original size [2023-11-21 21:02:08,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 4416 treesize of output 4028 [2023-11-21 21:02:09,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:02:09,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3516 treesize of output 3284