./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu --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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:13,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:13,849 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:39:13,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:13,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:13,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:13,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:13,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:13,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:13,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:13,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:13,905 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:13,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:13,906 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:39:13,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:39:13,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:39:13,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:13,908 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:39:13,908 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:39:13,909 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:39:13,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:13,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:39:13,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:39:13,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:39:13,911 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:13,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:13,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:13,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:13,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:13,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:13,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:13,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:39:13,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:39:13,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:13,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:13,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:13,915 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:13,915 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_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/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_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu 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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-11-19 07:39:14,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:14,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:14,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:14,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:14,300 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:14,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-19 07:39:17,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:17,534 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:17,534 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-19 07:39:17,552 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/data/7d59b1734/d7a2f84081674ee29a5f28613bc58832/FLAG7d0952ae6 [2023-11-19 07:39:17,573 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/data/7d59b1734/d7a2f84081674ee29a5f28613bc58832 [2023-11-19 07:39:17,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:17,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:17,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:17,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:17,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:17,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:17" (1/1) ... [2023-11-19 07:39:17,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32066098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:17, skipping insertion in model container [2023-11-19 07:39:17,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:17" (1/1) ... [2023-11-19 07:39:17,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:17,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:17,988 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:18,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:18,110 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:18,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18 WrapperNode [2023-11-19 07:39:18,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:18,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:18,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:18,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:18,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,164 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2023-11-19 07:39:18,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:18,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:18,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:18,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:18,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:18,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:18,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:18,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:18,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (1/1) ... [2023-11-19 07:39:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:18,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:39:18,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:39:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 07:39:18,288 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 07:39:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:39:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:39:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:39:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:39:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:39:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:39:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:39:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:18,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:18,445 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:18,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:18,503 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 07:39:18,882 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:18,890 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:18,890 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:39:18,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:18 BoogieIcfgContainer [2023-11-19 07:39:18,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:18,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:18,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:18,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:18,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:17" (1/3) ... [2023-11-19 07:39:18,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656dbc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:18, skipping insertion in model container [2023-11-19 07:39:18,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:18" (2/3) ... [2023-11-19 07:39:18,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656dbc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:18, skipping insertion in model container [2023-11-19 07:39:18,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:18" (3/3) ... [2023-11-19 07:39:18,906 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-11-19 07:39:18,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:18,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-19 07:39:18,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:18,996 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;@4a49b1fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:18,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-19 07:39:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-19 07:39:19,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:19,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-19 07:39:19,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:19,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-11-19 07:39:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715719440] [2023-11-19 07:39:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:19,280 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-19 07:39:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715719440] [2023-11-19 07:39:19,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715719440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:19,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144578815] [2023-11-19 07:39:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:19,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:19,329 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:19,425 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-19 07:39:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:19,428 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-19 07:39:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:19,434 INFO L225 Difference]: With dead ends: 78 [2023-11-19 07:39:19,435 INFO L226 Difference]: Without dead ends: 72 [2023-11-19 07:39:19,436 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-19 07:39:19,440 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:19,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-19 07:39:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-19 07:39:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.829268292682927) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2023-11-19 07:39:19,477 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2023-11-19 07:39:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:19,477 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2023-11-19 07:39:19,478 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2023-11-19 07:39:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-19 07:39:19,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:19,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-19 07:39:19,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:19,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:19,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-11-19 07:39:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952953723] [2023-11-19 07:39:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:19,590 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-19 07:39:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952953723] [2023-11-19 07:39:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952953723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335654401] [2023-11-19 07:39:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:19,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:19,595 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:19,664 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2023-11-19 07:39:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:19,665 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-19 07:39:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:19,666 INFO L225 Difference]: With dead ends: 68 [2023-11-19 07:39:19,666 INFO L226 Difference]: Without dead ends: 68 [2023-11-19 07:39:19,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:19,669 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:19,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-19 07:39:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-19 07:39:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-11-19 07:39:19,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 4 [2023-11-19 07:39:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:19,679 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-11-19 07:39:19,679 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-11-19 07:39:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 07:39:19,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:19,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:19,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:19,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2023-11-19 07:39:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260115958] [2023-11-19 07:39:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:19,854 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-19 07:39:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260115958] [2023-11-19 07:39:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260115958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212798377] [2023-11-19 07:39:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:19,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:19,857 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:19,935 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-11-19 07:39:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 07:39:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:19,938 INFO L225 Difference]: With dead ends: 66 [2023-11-19 07:39:19,938 INFO L226 Difference]: Without dead ends: 66 [2023-11-19 07:39:19,939 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-19 07:39:19,949 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:19,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-19 07:39:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-19 07:39:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-11-19 07:39:19,966 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2023-11-19 07:39:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:19,966 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-11-19 07:39:19,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-11-19 07:39:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 07:39:19,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:19,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:19,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:19,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:19,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2023-11-19 07:39:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173932209] [2023-11-19 07:39:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:20,238 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-19 07:39:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173932209] [2023-11-19 07:39:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173932209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406536797] [2023-11-19 07:39:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:20,243 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:20,312 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-11-19 07:39:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 07:39:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:20,316 INFO L225 Difference]: With dead ends: 64 [2023-11-19 07:39:20,317 INFO L226 Difference]: Without dead ends: 64 [2023-11-19 07:39:20,317 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-19 07:39:20,326 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:20,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-19 07:39:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-19 07:39:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-11-19 07:39:20,339 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2023-11-19 07:39:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:20,339 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-11-19 07:39:20,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-11-19 07:39:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 07:39:20,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:20,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:20,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:20,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2023-11-19 07:39:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949843301] [2023-11-19 07:39:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:20,458 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-19 07:39:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949843301] [2023-11-19 07:39:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949843301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967787902] [2023-11-19 07:39:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:20,463 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:20,476 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2023-11-19 07:39:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 07:39:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:20,478 INFO L225 Difference]: With dead ends: 72 [2023-11-19 07:39:20,478 INFO L226 Difference]: Without dead ends: 72 [2023-11-19 07:39:20,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:20,479 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:20,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-19 07:39:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2023-11-19 07:39:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-19 07:39:20,492 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2023-11-19 07:39:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:20,493 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-19 07:39:20,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-19 07:39:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:39:20,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:20,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:20,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:20,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:20,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 243865783, now seen corresponding path program 1 times [2023-11-19 07:39:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921058012] [2023-11-19 07:39:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:20,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921058012] [2023-11-19 07:39:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921058012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270091937] [2023-11-19 07:39:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:20,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:20,717 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:20,820 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-11-19 07:39:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:39:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:20,826 INFO L225 Difference]: With dead ends: 70 [2023-11-19 07:39:20,827 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 07:39:20,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:20,829 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:20,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 07:39:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-11-19 07:39:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-11-19 07:39:20,846 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2023-11-19 07:39:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:20,846 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-11-19 07:39:20,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-11-19 07:39:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:39:20,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:20,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:20,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:20,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2023-11-19 07:39:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350383111] [2023-11-19 07:39:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,128 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-19 07:39:21,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:21,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350383111] [2023-11-19 07:39:21,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350383111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:21,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:21,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008824963] [2023-11-19 07:39:21,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:21,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:21,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:21,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:21,131 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:21,286 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-11-19 07:39:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:39:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:21,287 INFO L225 Difference]: With dead ends: 70 [2023-11-19 07:39:21,288 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 07:39:21,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:21,289 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:21,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 139 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 07:39:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-11-19 07:39:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2023-11-19 07:39:21,294 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2023-11-19 07:39:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:21,295 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2023-11-19 07:39:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2023-11-19 07:39:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 07:39:21,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:21,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:21,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:21,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:21,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2023-11-19 07:39:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897796137] [2023-11-19 07:39:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897796137] [2023-11-19 07:39:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897796137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001207263] [2023-11-19 07:39:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:21,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:21,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:21,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:39:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:21,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:39:21,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:21,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001207263] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:21,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-19 07:39:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486697343] [2023-11-19 07:39:21,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:21,662 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:21,687 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-11-19 07:39:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 07:39:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:21,689 INFO L225 Difference]: With dead ends: 87 [2023-11-19 07:39:21,689 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 07:39:21,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:21,691 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:21,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 242 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 07:39:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-19 07:39:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 82 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-11-19 07:39:21,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2023-11-19 07:39:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:21,700 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-11-19 07:39:21,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-11-19 07:39:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:21,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:21,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:21,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:21,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-19 07:39:21,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:21,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -868554549, now seen corresponding path program 1 times [2023-11-19 07:39:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225959011] [2023-11-19 07:39:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225959011] [2023-11-19 07:39:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225959011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123236319] [2023-11-19 07:39:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:22,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:22,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:39:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:22,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 07:39:22,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:22,250 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-19 07:39:22,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 07:39:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 07:39:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:22,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123236319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:22,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-11-19 07:39:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854785826] [2023-11-19 07:39:22,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:22,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:22,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:22,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:22,387 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:22,501 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-11-19 07:39:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:39:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:22,502 INFO L225 Difference]: With dead ends: 81 [2023-11-19 07:39:22,502 INFO L226 Difference]: Without dead ends: 81 [2023-11-19 07:39:22,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:22,505 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:22,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 144 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-19 07:39:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-19 07:39:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-19 07:39:22,511 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 18 [2023-11-19 07:39:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:22,511 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-19 07:39:22,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-19 07:39:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:22,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:22,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:22,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:22,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:22,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:22,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2023-11-19 07:39:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261103799] [2023-11-19 07:39:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261103799] [2023-11-19 07:39:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261103799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663411262] [2023-11-19 07:39:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:23,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:23,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:23,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:39:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:23,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-19 07:39:23,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:23,217 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-19 07:39:23,274 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 07:39:23,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 07:39:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:23,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663411262] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:23,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2023-11-19 07:39:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099320055] [2023-11-19 07:39:23,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:23,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:23,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:23,410 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:23,533 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-19 07:39:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:39:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:23,534 INFO L225 Difference]: With dead ends: 79 [2023-11-19 07:39:23,534 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 07:39:23,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:23,535 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:23,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 07:39:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 07:39:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2023-11-19 07:39:23,540 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2023-11-19 07:39:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:23,540 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2023-11-19 07:39:23,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2023-11-19 07:39:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:39:23,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:23,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:23,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:23,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 07:39:23,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:23,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2023-11-19 07:39:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183679958] [2023-11-19 07:39:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-19 07:39:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183679958] [2023-11-19 07:39:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183679958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:23,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873556084] [2023-11-19 07:39:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:23,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:23,963 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:24,137 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-11-19 07:39:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:39:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-19 07:39:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:24,141 INFO L225 Difference]: With dead ends: 94 [2023-11-19 07:39:24,141 INFO L226 Difference]: Without dead ends: 94 [2023-11-19 07:39:24,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:24,142 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:24,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 103 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-19 07:39:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2023-11-19 07:39:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-19 07:39:24,152 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2023-11-19 07:39:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:24,153 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-19 07:39:24,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-19 07:39:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:39:24,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:24,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:24,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:39:24,156 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:24,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2023-11-19 07:39:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:24,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449394641] [2023-11-19 07:39:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 07:39:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449394641] [2023-11-19 07:39:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449394641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864157736] [2023-11-19 07:39:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:24,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:24,528 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:24,715 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2023-11-19 07:39:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:39:24,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-19 07:39:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:24,717 INFO L225 Difference]: With dead ends: 84 [2023-11-19 07:39:24,717 INFO L226 Difference]: Without dead ends: 84 [2023-11-19 07:39:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:24,718 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:24,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-19 07:39:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2023-11-19 07:39:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-19 07:39:24,721 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2023-11-19 07:39:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:24,721 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-19 07:39:24,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-19 07:39:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-19 07:39:24,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:24,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:39:24,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:24,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1658160837, now seen corresponding path program 1 times [2023-11-19 07:39:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030900795] [2023-11-19 07:39:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:39:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030900795] [2023-11-19 07:39:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030900795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251427360] [2023-11-19 07:39:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:25,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:25,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:25,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:25,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:39:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:25,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-19 07:39:25,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:26,081 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:39:26,081 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-19 07:39:26,224 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-19 07:39:26,225 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 16 treesize of output 22 [2023-11-19 07:39:26,481 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-19 07:39:26,482 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 16 treesize of output 18 [2023-11-19 07:39:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:39:26,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:39:26,693 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 16 treesize of output 11 [2023-11-19 07:39:26,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-19 07:39:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:26,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:26,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_908) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2023-11-19 07:39:26,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_908) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-19 07:39:27,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:39:27,086 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 21 treesize of output 22 [2023-11-19 07:39:27,092 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 60 treesize of output 52 [2023-11-19 07:39:27,106 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 48 treesize of output 44 [2023-11-19 07:39:27,114 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 22 treesize of output 20 [2023-11-19 07:39:27,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:39:27,919 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 106 treesize of output 124 [2023-11-19 07:39:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-19 07:39:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251427360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:28,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2023-11-19 07:39:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140062356] [2023-11-19 07:39:28,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-19 07:39:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-19 07:39:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1328, Unknown=7, NotChecked=150, Total=1640 [2023-11-19 07:39:28,044 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:28,863 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2023-11-19 07:39:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:39:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-19 07:39:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:28,864 INFO L225 Difference]: With dead ends: 79 [2023-11-19 07:39:28,864 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 07:39:28,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=1994, Unknown=7, NotChecked=190, Total=2550 [2023-11-19 07:39:28,866 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 92 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:28,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 692 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 545 Invalid, 0 Unknown, 61 Unchecked, 0.4s Time] [2023-11-19 07:39:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 07:39:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 07:39:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2023-11-19 07:39:28,869 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 41 [2023-11-19 07:39:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:28,870 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2023-11-19 07:39:28,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2023-11-19 07:39:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 07:39:28,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:28,871 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:28,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:29,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-19 07:39:29,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:29,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2023-11-19 07:39:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087729994] [2023-11-19 07:39:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-19 07:39:29,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:29,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087729994] [2023-11-19 07:39:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087729994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102958363] [2023-11-19 07:39:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:29,331 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:29,556 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2023-11-19 07:39:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:39:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-19 07:39:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:29,557 INFO L225 Difference]: With dead ends: 98 [2023-11-19 07:39:29,557 INFO L226 Difference]: Without dead ends: 98 [2023-11-19 07:39:29,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:29,558 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 96 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:29,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 114 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:39:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-19 07:39:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2023-11-19 07:39:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-11-19 07:39:29,562 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2023-11-19 07:39:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:29,562 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-11-19 07:39:29,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-11-19 07:39:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 07:39:29,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:29,563 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:29,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:39:29,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:29,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2023-11-19 07:39:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961557537] [2023-11-19 07:39:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 07:39:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961557537] [2023-11-19 07:39:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961557537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728980592] [2023-11-19 07:39:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:29,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:29,913 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:30,120 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2023-11-19 07:39:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:39:30,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-19 07:39:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:30,121 INFO L225 Difference]: With dead ends: 80 [2023-11-19 07:39:30,122 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 07:39:30,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:39:30,122 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:30,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 122 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:39:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 07:39:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-11-19 07:39:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.21875) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2023-11-19 07:39:30,126 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2023-11-19 07:39:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:30,126 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2023-11-19 07:39:30,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2023-11-19 07:39:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 07:39:30,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:30,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:30,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:39:30,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:30,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2023-11-19 07:39:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435684673] [2023-11-19 07:39:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:39:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435684673] [2023-11-19 07:39:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435684673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413086361] [2023-11-19 07:39:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:31,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:31,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:39:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:31,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-19 07:39:31,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:31,832 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 07:39:31,832 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-19 07:39:31,886 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 07:39:31,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 07:39:31,971 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-19 07:39:31,971 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 16 treesize of output 18 [2023-11-19 07:39:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 07:39:32,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-19 07:39:32,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-19 07:39:32,064 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-11-19 07:39:32,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-11-19 07:39:32,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-11-19 07:39:32,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-11-19 07:39:32,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-19 07:39:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:39:32,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:32,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 1)) is different from false [2023-11-19 07:39:32,416 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) 1)) is different from false [2023-11-19 07:39:32,429 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-11-19 07:39:32,429 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 24 treesize of output 23 [2023-11-19 07:39:34,535 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1388 (Array Int Int))) (or (not (= v_ArrVal_1388 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1388 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1388) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1389) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2023-11-19 07:39:34,545 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 74 treesize of output 72 [2023-11-19 07:39:34,552 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 28 treesize of output 24 [2023-11-19 07:39:34,557 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 54 treesize of output 46 [2023-11-19 07:39:34,813 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 07:39:34,813 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 16 treesize of output 15 [2023-11-19 07:39:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 20 refuted. 1 times theorem prover too weak. 2 trivial. 10 not checked. [2023-11-19 07:39:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413086361] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:34,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2023-11-19 07:39:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283688361] [2023-11-19 07:39:34,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-19 07:39:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-19 07:39:34,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1201, Unknown=14, NotChecked=216, Total=1560 [2023-11-19 07:39:34,831 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:36,073 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-19 07:39:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:39:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-19 07:39:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:36,074 INFO L225 Difference]: With dead ends: 89 [2023-11-19 07:39:36,074 INFO L226 Difference]: Without dead ends: 89 [2023-11-19 07:39:36,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=321, Invalid=2029, Unknown=14, NotChecked=288, Total=2652 [2023-11-19 07:39:36,076 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:36,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 390 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 706 Invalid, 0 Unknown, 200 Unchecked, 0.5s Time] [2023-11-19 07:39:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-19 07:39:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-11-19 07:39:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-19 07:39:36,080 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2023-11-19 07:39:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:36,080 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-19 07:39:36,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-19 07:39:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 07:39:36,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:36,081 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:36,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-19 07:39:36,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:36,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2023-11-19 07:39:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929823531] [2023-11-19 07:39:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:39:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929823531] [2023-11-19 07:39:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929823531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062137823] [2023-11-19 07:39:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:38,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:38,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:38,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:39:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:38,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-19 07:39:38,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:38,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 07:39:38,565 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-19 07:39:38,621 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 07:39:38,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 07:39:38,630 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-19 07:39:38,753 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-19 07:39:38,753 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 16 treesize of output 18 [2023-11-19 07:39:38,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 07:39:38,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 07:39:38,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 07:39:38,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-19 07:39:38,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-19 07:39:38,907 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-19 07:39:38,908 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-19 07:39:38,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-19 07:39:39,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-11-19 07:39:39,054 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 18 treesize of output 13 [2023-11-19 07:39:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-19 07:39:39,102 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 41 treesize of output 19 [2023-11-19 07:39:39,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-11-19 07:39:39,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-19 07:39:39,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-19 07:39:39,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-19 07:39:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:39:39,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:39,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1640 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1641) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)))))) is different from false [2023-11-19 07:39:39,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1640 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2023-11-19 07:39:39,613 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1638) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2023-11-19 07:39:39,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1636 (Array Int Int))) (or (forall ((v_ArrVal_1637 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1637 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1637)) (forall ((v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1638) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1636 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1636)))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1637 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1637)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 1)))))) is different from false [2023-11-19 07:39:39,694 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 294 treesize of output 292 [2023-11-19 07:39:39,702 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 406 treesize of output 404 [2023-11-19 07:39:39,712 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 45 treesize of output 41 [2023-11-19 07:39:39,723 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 41 treesize of output 37 [2023-11-19 07:39:39,739 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 40 treesize of output 32 [2023-11-19 07:39:39,742 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 32 treesize of output 24 [2023-11-19 07:39:39,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:39:39,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:39:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-19 07:39:39,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:39:39,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-19 07:39:39,775 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 18 treesize of output 10 [2023-11-19 07:39:40,300 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 07:39:40,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-19 07:39:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 13 not checked. [2023-11-19 07:39:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062137823] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:40,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2023-11-19 07:39:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173671413] [2023-11-19 07:39:40,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-19 07:39:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-19 07:39:40,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1504, Unknown=4, NotChecked=324, Total=1980 [2023-11-19 07:39:40,316 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:42,429 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2023-11-19 07:39:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 07:39:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-19 07:39:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:42,430 INFO L225 Difference]: With dead ends: 100 [2023-11-19 07:39:42,430 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:39:42,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=359, Invalid=2623, Unknown=4, NotChecked=436, Total=3422 [2023-11-19 07:39:42,433 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 175 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:42,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 407 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 926 Invalid, 0 Unknown, 339 Unchecked, 0.8s Time] [2023-11-19 07:39:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:39:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2023-11-19 07:39:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-19 07:39:42,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2023-11-19 07:39:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:42,436 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-19 07:39:42,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-19 07:39:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-19 07:39:42,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:42,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:42,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:42,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-19 07:39:42,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-19 07:39:42,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1550719723, now seen corresponding path program 1 times [2023-11-19 07:39:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77493170] [2023-11-19 07:39:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77493170] [2023-11-19 07:39:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77493170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:45,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125314967] [2023-11-19 07:39:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:45,693 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:45,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9c5a680-9bd3-4cef-99bc-7b082ebc4ca3/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 07:39:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:45,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-19 07:39:45,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:46,163 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:39:46,164 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-19 07:39:46,354 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-19 07:39:46,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-19 07:39:46,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:39:46,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:39:46,807 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-19 07:39:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-19 07:39:46,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:39:46,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-19 07:39:46,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:39:47,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:39:47,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:39:47,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:39:47,074 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:39:47,074 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2023-11-19 07:39:47,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 07:39:47,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-19 07:39:47,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-19 07:39:47,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:39:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:39:47,392 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 23 treesize of output 11 [2023-11-19 07:39:47,400 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 35 treesize of output 19 [2023-11-19 07:39:47,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:39:47,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:39:47,633 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 35 treesize of output 19 [2023-11-19 07:39:47,647 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 23 treesize of output 11 [2023-11-19 07:39:47,666 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-19 07:39:47,671 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 27 treesize of output 15 [2023-11-19 07:39:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:47,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:48,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1906) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1906) .cse2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|)))))) is different from false [2023-11-19 07:39:48,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) .cse2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2023-11-19 07:39:48,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse0))))) (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) .cse4) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))))))) is different from false [2023-11-19 07:39:48,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1892 (Array Int Int))) (or (not (= v_ArrVal_1892 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1892 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1893 (Array Int Int))) (or (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1893 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1893)))))) (forall ((v_ArrVal_1892 (Array Int Int))) (or (not (= v_ArrVal_1892 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1892 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1893 (Array Int Int))) (or (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1897) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1893 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1893)))))))) is different from false [2023-11-19 07:39:48,669 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 446 treesize of output 444 [2023-11-19 07:39:48,682 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 105 treesize of output 101 [2023-11-19 07:39:48,691 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 1507 treesize of output 1505 [2023-11-19 07:39:48,718 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 105 treesize of output 97 [2023-11-19 07:39:48,738 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 82 treesize of output 74 [2023-11-19 07:39:48,748 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 103 treesize of output 87 [2023-11-19 07:39:49,676 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 571 treesize of output 569 [2023-11-19 07:39:49,692 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 135 treesize of output 127 [2023-11-19 07:39:49,705 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 1382 treesize of output 1380 [2023-11-19 07:39:49,730 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 75 treesize of output 71 [2023-11-19 07:39:49,750 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 111 treesize of output 95 [2023-11-19 07:39:49,759 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 74 treesize of output 66 [2023-11-19 07:39:52,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse40 (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (or (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse18 (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (.cse5 (not .cse23)) (.cse14 (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (= (select (select .cse54 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse17 (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse53 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse36 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (not .cse10))) (let ((.cse19 (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse24 (and .cse36 .cse2)) (.cse30 (forall ((v_arrayElimCell_98 Int)) (or (forall ((v_arrayElimCell_96 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse52 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse52 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98)))) (.cse34 (or .cse17 .cse23)) (.cse33 (or .cse14 .cse23)) (.cse35 (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_97 Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98))) .cse5)) (.cse32 (or .cse23 .cse18)) (.cse11 (forall ((v_arrayElimCell_98 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse51 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse51 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse12 (forall ((v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int) (v_arrayElimCell_97 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98)))) (.cse31 (forall ((v_arrayElimCell_98 Int)) (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse50 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98)))) (.cse6 (or .cse40 .cse23)) (.cse7 (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_100 Int)) (or (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse49 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_104 Int)) (= (select (select .cse49 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (.cse0 (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse1 (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse48 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse48 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse27 (or .cse10 .cse18)) (.cse25 (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse47 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (.cse28 (forall ((v_arrayElimCell_100 Int)) (or (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse46 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))))) (and (or (and .cse0 .cse1 (or .cse2 (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1898 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse3 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse3 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse5) (or .cse2 (and .cse6 .cse7)) (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse8 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse8 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (and (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_97 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse9 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98)))) .cse10) .cse11 .cse12 (or .cse2 (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_97 Int)) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse13 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98) (= (select (select .cse13 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse5) (or (let ((.cse16 (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1898 Int)) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse22 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (and .cse14 (or (and (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_96 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_98 Int) (v_ArrVal_1898 Int)) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse15 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse15 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse16 .cse17 .cse18) .cse10) (or .cse2 (and .cse19 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_98 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse20 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse20 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or (and .cse16 .cse18) .cse10) (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_98 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse21 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse21 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse23 .cse24) (or .cse10 (and (or .cse23 (and .cse25 .cse18)) .cse1 (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse26 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse23 (and .cse27 .cse28)) (or (and (or .cse2 (and (forall ((v_arrayElimCell_98 Int)) (or (forall ((v_arrayElimCell_96 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_96) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse29 v_arrayElimCell_94) v_arrayElimCell_96) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_97 Int)) (= (select (select .cse29 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_arrayElimCell_98))) (or .cse19 .cse23))) .cse30 (or .cse10 (and .cse31 .cse32)) .cse33 (or (and .cse11 .cse34 .cse31 .cse32) .cse10) .cse35) .cse24) (or (and (or .cse36 (and .cse11 .cse30 .cse34 .cse33 .cse31 .cse35 .cse32)) (or (and .cse11 .cse12 .cse31) .cse5)) .cse10) (or (and .cse6 .cse7 (or .cse23 (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse37 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and .cse0 .cse1 (forall ((v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse38 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse38 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse5)) .cse2) (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1898 Int)) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906) v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (or .cse10 (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1898 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse39 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse23 (and (or (and .cse40 (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_103 Int)) (or (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_102 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= (select (select .cse41 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_104 Int)) (= (select (select .cse41 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse2) .cse27 (or .cse10 (and (forall ((v_ArrVal_1900 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse42 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse42 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse25 (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_arrayElimCell_103 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse43 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18)) (forall ((v_arrayElimCell_100 Int) (v_arrayElimCell_103 Int)) (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1898 Int)) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (forall ((v_arrayElimCell_102 Int)) (= (select (select .cse44 v_arrayElimCell_100) v_arrayElimCell_102) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse44 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= v_arrayElimCell_100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse28 (or (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1894 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_1906 (Array Int Int)) (v_arrayElimCell_103 Int) (v_ArrVal_1898 Int)) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 v_ArrVal_1898)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1900) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1906))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse45 v_arrayElimCell_103) v_arrayElimCell_104) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse10))))))) is different from false