./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:07:44,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:07:44,857 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:07:44,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:07:44,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:07:44,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:07:44,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:07:44,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:07:44,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:07:44,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:07:44,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:07:44,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:07:44,920 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:07:44,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:07:44,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:07:44,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:07:44,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:07:44,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:07:44,924 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:07:44,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:07:44,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:07:44,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:07:44,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:07:44,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:07:44,928 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:07:44,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:07:44,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:07:44,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:07:44,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:07:44,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:07:44,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:07:44,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:07:44,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:07:44,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:07:44,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:07:44,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:07:44,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:07:44,935 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:07:44,936 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_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2023-11-06 22:07:45,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:07:45,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:07:45,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:07:45,274 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:07:45,275 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:07:45,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2023-11-06 22:07:48,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:07:48,776 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:07:48,777 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2023-11-06 22:07:48,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/data/475273564/1f586f8172384fbc953e2bade99d6327/FLAG8adbc09a3 [2023-11-06 22:07:48,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/data/475273564/1f586f8172384fbc953e2bade99d6327 [2023-11-06 22:07:48,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:07:48,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:07:48,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:07:48,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:07:48,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:07:48,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:07:48" (1/1) ... [2023-11-06 22:07:48,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a91dca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:48, skipping insertion in model container [2023-11-06 22:07:48,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:07:48" (1/1) ... [2023-11-06 22:07:48,912 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:07:49,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:07:49,369 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:07:49,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:07:49,479 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:07:49,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49 WrapperNode [2023-11-06 22:07:49,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:07:49,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:07:49,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:07:49,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:07:49,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,578 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2023-11-06 22:07:49,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:07:49,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:07:49,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:07:49,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:07:49,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:07:49,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:07:49,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:07:49,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:07:49,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (1/1) ... [2023-11-06 22:07:49,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:07:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:49,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:07:49,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:07:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 22:07:49,733 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 22:07:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:07:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:07:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:07:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:07:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:07:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:07:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:07:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:07:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:07:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:07:49,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:07:49,948 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:07:49,950 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:07:49,999 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 22:07:50,382 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:07:50,389 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:07:50,389 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:07:50,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:07:50 BoogieIcfgContainer [2023-11-06 22:07:50,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:07:50,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:07:50,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:07:50,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:07:50,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:07:48" (1/3) ... [2023-11-06 22:07:50,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676eb7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:07:50, skipping insertion in model container [2023-11-06 22:07:50,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:49" (2/3) ... [2023-11-06 22:07:50,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676eb7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:07:50, skipping insertion in model container [2023-11-06 22:07:50,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:07:50" (3/3) ... [2023-11-06 22:07:50,402 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2023-11-06 22:07:50,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:07:50,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-06 22:07:50,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:07:50,485 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;@39c7cdb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:07:50,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-11-06 22:07:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 43 states have (on average 2.046511627906977) internal successors, (88), 77 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:07:50,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:50,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:07:50,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:50,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2023-11-06 22:07:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844138099] [2023-11-06 22:07:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844138099] [2023-11-06 22:07:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844138099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:07:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580105951] [2023-11-06 22:07:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:50,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:50,918 INFO L87 Difference]: Start difference. First operand has 79 states, 43 states have (on average 2.046511627906977) internal successors, (88), 77 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:51,091 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2023-11-06 22:07:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:07:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:51,102 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:07:51,102 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:07:51,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:51,107 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:51,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:07:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:07:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-06 22:07:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-11-06 22:07:51,144 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 5 [2023-11-06 22:07:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:51,148 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-11-06 22:07:51,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-11-06 22:07:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:07:51,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:51,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:07:51,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:07:51,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:51,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2023-11-06 22:07:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153993104] [2023-11-06 22:07:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153993104] [2023-11-06 22:07:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153993104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:51,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:51,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:07:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112269479] [2023-11-06 22:07:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:51,322 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:51,424 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-11-06 22:07:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:07:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:51,428 INFO L225 Difference]: With dead ends: 67 [2023-11-06 22:07:51,428 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 22:07:51,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:51,430 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:51,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 103 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:07:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 22:07:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-06 22:07:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 66 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-06 22:07:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-06 22:07:51,441 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 5 [2023-11-06 22:07:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:51,441 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-06 22:07:51,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-06 22:07:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:07:51,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:51,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:51,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:07:51,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:51,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113103, now seen corresponding path program 1 times [2023-11-06 22:07:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743548892] [2023-11-06 22:07:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743548892] [2023-11-06 22:07:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743548892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:07:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154546986] [2023-11-06 22:07:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:51,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:51,505 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:51,520 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-06 22:07:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-06 22:07:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:51,523 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:07:51,523 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:07:51,523 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-06 22:07:51,525 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 135 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-06 22:07:51,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:07:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2023-11-06 22:07:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.8) internal successors, (72), 67 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-06 22:07:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-06 22:07:51,535 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2023-11-06 22:07:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:51,536 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-06 22:07:51,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-06 22:07:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:07:51,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:51,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:07:51,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:51,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2023-11-06 22:07:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11686162] [2023-11-06 22:07:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11686162] [2023-11-06 22:07:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11686162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:07:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419626169] [2023-11-06 22:07:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:51,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:07:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:51,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:07:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:07:51,624 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:51,648 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2023-11-06 22:07:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:07:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:07:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:51,650 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:07:51,650 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:07:51,651 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-06 22:07:51,653 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:51,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:07:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2023-11-06 22:07:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-11-06 22:07:51,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 9 [2023-11-06 22:07:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:51,664 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-11-06 22:07:51,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-11-06 22:07:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:07:51,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:51,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:51,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:07:51,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:51,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -763066850, now seen corresponding path program 1 times [2023-11-06 22:07:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973554185] [2023-11-06 22:07:51,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:51,821 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-06 22:07:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973554185] [2023-11-06 22:07:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973554185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966724122] [2023-11-06 22:07:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:51,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:51,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:51,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:51,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:07:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:52,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:07:52,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:52,159 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-06 22:07:52,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:52,207 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-06 22:07:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966724122] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:52,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:07:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208894348] [2023-11-06 22:07:52,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:52,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:07:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:07:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:52,213 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:52,238 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2023-11-06 22:07:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:07:52,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 22:07:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:52,247 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:07:52,250 INFO L226 Difference]: Without dead ends: 75 [2023-11-06 22:07:52,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:52,258 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:52,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 201 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-06 22:07:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-06 22:07:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-11-06 22:07:52,273 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 14 [2023-11-06 22:07:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:52,274 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-06 22:07:52,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2023-11-06 22:07:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:07:52,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:52,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:52,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:52,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:52,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:52,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:52,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2023-11-06 22:07:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199492578] [2023-11-06 22:07:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199492578] [2023-11-06 22:07:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199492578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753911684] [2023-11-06 22:07:52,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:52,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:52,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:52,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:07:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:52,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:07:52,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:53,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:07:53,064 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:07:53,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:07:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:53,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753911684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:53,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-06 22:07:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063386701] [2023-11-06 22:07:53,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:53,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:07:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:07:53,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:53,247 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:53,448 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2023-11-06 22:07:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:53,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-06 22:07:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:53,452 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:07:53,452 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:07:53,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:53,457 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:53,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 187 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:07:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:07:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-06 22:07:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 73 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-06 22:07:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-11-06 22:07:53,481 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 16 [2023-11-06 22:07:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:53,482 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-11-06 22:07:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-11-06 22:07:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:07:53,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:53,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:53,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:07:53,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:07:53,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:53,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2023-11-06 22:07:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115574096] [2023-11-06 22:07:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:53,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115574096] [2023-11-06 22:07:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115574096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:53,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714581126] [2023-11-06 22:07:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:53,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:53,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:54,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:07:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:54,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:07:54,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:54,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:07:54,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:54,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:07:54,244 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:07:54,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:07:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:54,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:54,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-06 22:07:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714581126] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:54,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-06 22:07:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099123418] [2023-11-06 22:07:54,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:54,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:07:54,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:54,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:07:54,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:07:54,594 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:54,821 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-11-06 22:07:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:54,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:07:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:54,822 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:07:54,822 INFO L226 Difference]: Without dead ends: 73 [2023-11-06 22:07:54,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:07:54,823 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:54,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 213 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:07:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-06 22:07:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-06 22:07:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-11-06 22:07:54,829 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 16 [2023-11-06 22:07:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:54,830 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-11-06 22:07:54,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-11-06 22:07:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:07:54,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:54,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:54,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:07:55,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:07:55,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:55,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 2 times [2023-11-06 22:07:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220037815] [2023-11-06 22:07:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:55,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220037815] [2023-11-06 22:07:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220037815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694380392] [2023-11-06 22:07:55,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:07:55,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:55,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:55,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:55,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:07:55,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:07:55,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:07:55,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:07:55,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:07:55,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694380392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:55,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:07:55,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-06 22:07:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514723551] [2023-11-06 22:07:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:55,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:55,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:07:55,260 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:55,280 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-11-06 22:07:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:07:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 22:07:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:55,282 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:07:55,282 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:07:55,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:55,283 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 147 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:55,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:07:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2023-11-06 22:07:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.625) internal successors, (78), 73 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-06 22:07:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-11-06 22:07:55,289 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 21 [2023-11-06 22:07:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:55,290 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-11-06 22:07:55,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-11-06 22:07:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:07:55,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:55,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:55,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:55,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:07:55,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:55,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2023-11-06 22:07:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643251306] [2023-11-06 22:07:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643251306] [2023-11-06 22:07:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643251306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810523307] [2023-11-06 22:07:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:55,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:55,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:07:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:55,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:07:55,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:55,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810523307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:55,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-06 22:07:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94309505] [2023-11-06 22:07:55,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:55,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:07:55,788 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-06 22:07:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:55,826 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2023-11-06 22:07:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 22:07:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:55,828 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:07:55,828 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:07:55,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:55,831 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:55,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:07:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-06 22:07:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2023-11-06 22:07:55,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 21 [2023-11-06 22:07:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:55,843 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2023-11-06 22:07:55,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-06 22:07:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2023-11-06 22:07:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:07:55,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:55,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:55,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:56,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:07:56,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:56,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2023-11-06 22:07:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948154132] [2023-11-06 22:07:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:07:56,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948154132] [2023-11-06 22:07:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948154132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573044525] [2023-11-06 22:07:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:56,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:56,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:56,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:07:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:56,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:07:56,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:56,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:07:56,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:56,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:07:56,502 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:07:56,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:07:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:07:56,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:07:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573044525] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:56,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-06 22:07:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676184256] [2023-11-06 22:07:56,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:56,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:07:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:07:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:07:56,607 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:56,783 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2023-11-06 22:07:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:07:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:07:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:56,785 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:07:56,785 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:07:56,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:07:56,786 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 197 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:56,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 146 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:07:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:07:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2023-11-06 22:07:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-11-06 22:07:56,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 22 [2023-11-06 22:07:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:56,822 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-11-06 22:07:56,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-11-06 22:07:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:07:56,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:56,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:56,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:57,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:07:57,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:07:57,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2023-11-06 22:07:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211511057] [2023-11-06 22:07:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211511057] [2023-11-06 22:07:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211511057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015048822] [2023-11-06 22:07:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:57,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:57,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:57,420 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:57,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:07:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:57,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:07:57,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:57,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:07:57,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:57,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:07:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:57,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:07:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:07:57,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015048822] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:00,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:00,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2023-11-06 22:08:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415016151] [2023-11-06 22:08:00,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:00,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:08:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:08:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:08:00,132 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:00,370 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-11-06 22:08:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:08:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:08:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:00,372 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:08:00,372 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:08:00,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:08:00,373 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 270 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:00,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 90 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:08:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2023-11-06 22:08:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4489795918367347) 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-06 22:08:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-11-06 22:08:00,377 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 22 [2023-11-06 22:08:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:00,378 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-11-06 22:08:00,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-11-06 22:08:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:08:00,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:00,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:00,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:00,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:00,590 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:00,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2023-11-06 22:08:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138952190] [2023-11-06 22:08:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:08:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:00,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138952190] [2023-11-06 22:08:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138952190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:08:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109882906] [2023-11-06 22:08:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:00,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:00,789 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-06 22:08:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:01,060 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2023-11-06 22:08:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:08:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 23 [2023-11-06 22:08:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:01,062 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:08:01,062 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:08:01,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:01,063 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 92 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:01,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 190 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:08:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2023-11-06 22:08:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.46) 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-06 22:08:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-11-06 22:08:01,066 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 23 [2023-11-06 22:08:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:01,066 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-11-06 22:08:01,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-06 22:08:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-11-06 22:08:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:08:01,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:01,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:01,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:08:01,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:01,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2023-11-06 22:08:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444830744] [2023-11-06 22:08:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444830744] [2023-11-06 22:08:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444830744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:08:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226485150] [2023-11-06 22:08:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:01,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:01,433 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-06 22:08:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:01,722 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2023-11-06 22:08:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:08:01,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 23 [2023-11-06 22:08:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:01,723 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:08:01,723 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 22:08:01,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:01,724 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 137 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:01,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 205 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 22:08:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2023-11-06 22:08:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.44) 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-06 22:08:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2023-11-06 22:08:01,727 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 23 [2023-11-06 22:08:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:01,727 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2023-11-06 22:08:01,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-06 22:08:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2023-11-06 22:08:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:08:01,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:01,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:01,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:08:01,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:01,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1033118353, now seen corresponding path program 1 times [2023-11-06 22:08:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608389907] [2023-11-06 22:08:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608389907] [2023-11-06 22:08:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608389907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:01,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:08:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770295007] [2023-11-06 22:08:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:01,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:01,910 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:02,060 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2023-11-06 22:08:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:08:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 22:08:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:02,062 INFO L225 Difference]: With dead ends: 68 [2023-11-06 22:08:02,062 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 22:08:02,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:02,063 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 135 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:02,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 152 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 22:08:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-06 22:08:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.42) 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-06 22:08:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-11-06 22:08:02,065 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2023-11-06 22:08:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:02,066 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-11-06 22:08:02,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-11-06 22:08:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:08:02,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:02,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:08:02,067 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:02,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1961897973, now seen corresponding path program 1 times [2023-11-06 22:08:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:02,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166344891] [2023-11-06 22:08:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:02,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:02,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166344891] [2023-11-06 22:08:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166344891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:08:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002988648] [2023-11-06 22:08:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:02,290 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:02,563 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-11-06 22:08:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:08:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:08:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:02,565 INFO L225 Difference]: With dead ends: 89 [2023-11-06 22:08:02,565 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:08:02,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:08:02,568 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:02,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 194 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:08:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2023-11-06 22:08:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2023-11-06 22:08:02,572 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2023-11-06 22:08:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:02,573 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2023-11-06 22:08:02,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2023-11-06 22:08:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:08:02,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:02,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:02,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:08:02,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:02,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328922, now seen corresponding path program 1 times [2023-11-06 22:08:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544597398] [2023-11-06 22:08:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:02,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:02,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544597398] [2023-11-06 22:08:02,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544597398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:02,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:02,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540027094] [2023-11-06 22:08:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:02,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:02,730 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:02,875 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-06 22:08:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:08:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:02,877 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:08:02,877 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:08:02,877 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-06 22:08:02,878 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:02,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 121 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:08:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-11-06 22:08:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2023-11-06 22:08:02,880 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 27 [2023-11-06 22:08:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:02,881 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2023-11-06 22:08:02,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2023-11-06 22:08:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:08:02,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:02,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:02,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:08:02,883 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:02,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328923, now seen corresponding path program 1 times [2023-11-06 22:08:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:02,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920994976] [2023-11-06 22:08:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920994976] [2023-11-06 22:08:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920994976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:08:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475584402] [2023-11-06 22:08:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:03,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:08:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:08:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:08:03,370 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:03,822 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2023-11-06 22:08:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:08:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-06 22:08:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:03,825 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:08:03,825 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:08:03,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:08:03,826 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:03,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 202 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:08:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:08:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2023-11-06 22:08:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 77 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-06 22:08:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-06 22:08:03,831 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 27 [2023-11-06 22:08:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:03,832 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-06 22:08:03,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-06 22:08:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:08:03,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:03,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:03,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:08:03,837 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:03,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 689295123, now seen corresponding path program 1 times [2023-11-06 22:08:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282795827] [2023-11-06 22:08:03,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282795827] [2023-11-06 22:08:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282795827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:08:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167843082] [2023-11-06 22:08:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:03,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:03,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:03,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:03,934 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:04,033 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-06 22:08:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-06 22:08:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:04,034 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:08:04,035 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:08:04,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:04,036 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:04,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 118 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:08:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 22:08:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 76 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-06 22:08:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-06 22:08:04,039 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 28 [2023-11-06 22:08:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:04,040 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-06 22:08:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-06 22:08:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:08:04,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:04,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:08:04,041 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:04,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -106687560, now seen corresponding path program 1 times [2023-11-06 22:08:04,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:04,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555205529] [2023-11-06 22:08:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555205529] [2023-11-06 22:08:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555205529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099999817] [2023-11-06 22:08:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:04,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:04,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:04,338 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:04,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:08:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:04,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:08:04,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:04,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:08:04,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:08:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:04,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099999817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2023-11-06 22:08:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249303699] [2023-11-06 22:08:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:04,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:08:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:08:04,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:08:04,671 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-06 22:08:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:04,790 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-06 22:08:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 29 [2023-11-06 22:08:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:04,792 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:08:04,792 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:08:04,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:08:04,793 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 113 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:04,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:08:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-06 22:08:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-06 22:08:04,797 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 29 [2023-11-06 22:08:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:04,797 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-06 22:08:04,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-06 22:08:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-06 22:08:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:08:04,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:04,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:04,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:05,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:05,005 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:05,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 307453124, now seen corresponding path program 1 times [2023-11-06 22:08:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239110046] [2023-11-06 22:08:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239110046] [2023-11-06 22:08:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239110046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:08:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900367305] [2023-11-06 22:08:05,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:05,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:08:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:08:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:05,629 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-06 22:08:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:06,112 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-11-06 22:08:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:08:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-06 22:08:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:06,114 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:08:06,114 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:08:06,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:08:06,115 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 157 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:06,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 231 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:08:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:08:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-11-06 22:08:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 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-06 22:08:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-11-06 22:08:06,118 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 29 [2023-11-06 22:08:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:06,119 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-11-06 22:08:06,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-06 22:08:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-11-06 22:08:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:08:06,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:06,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:06,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:08:06,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:06,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash -890236208, now seen corresponding path program 1 times [2023-11-06 22:08:06,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:06,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734449995] [2023-11-06 22:08:06,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:06,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734449995] [2023-11-06 22:08:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734449995] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15748504] [2023-11-06 22:08:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:06,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:06,878 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:06,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:08:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:07,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:08:07,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:07,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:08:07,180 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:08:07,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:08:07,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:08:07,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:08:07,356 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:08:07,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2023-11-06 22:08:07,685 INFO L351 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 66 treesize of output 50 [2023-11-06 22:08:07,901 INFO L322 Elim1Store]: treesize reduction 3, result has 89.7 percent of original size [2023-11-06 22:08:07,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2023-11-06 22:08:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:07,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:08,137 INFO L351 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 28 treesize of output 20 [2023-11-06 22:08:08,392 INFO L322 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2023-11-06 22:08:08,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2023-11-06 22:08:08,402 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1198 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1198))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2023-11-06 22:08:08,618 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:08,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2023-11-06 22:08:08,680 INFO L322 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2023-11-06 22:08:08,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 141 [2023-11-06 22:08:08,709 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:08,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2023-11-06 22:08:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 22:08:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15748504] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:08,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2023-11-06 22:08:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810521793] [2023-11-06 22:08:08,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 22:08:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 22:08:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1416, Unknown=26, NotChecked=76, Total=1640 [2023-11-06 22:08:08,938 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 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-06 22:08:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:11,546 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-11-06 22:08:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:08:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 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) Word has length 31 [2023-11-06 22:08:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:11,548 INFO L225 Difference]: With dead ends: 96 [2023-11-06 22:08:11,548 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:08:11,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=424, Invalid=2859, Unknown=27, NotChecked=112, Total=3422 [2023-11-06 22:08:11,550 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 290 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:11,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 542 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1225 Invalid, 0 Unknown, 93 Unchecked, 1.1s Time] [2023-11-06 22:08:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:08:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2023-11-06 22:08:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 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-06 22:08:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-11-06 22:08:11,554 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 31 [2023-11-06 22:08:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:11,555 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-11-06 22:08:11,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 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-06 22:08:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-11-06 22:08:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:08:11,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:11,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:11,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:11,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:11,762 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:11,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash -890236207, now seen corresponding path program 1 times [2023-11-06 22:08:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450499002] [2023-11-06 22:08:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450499002] [2023-11-06 22:08:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450499002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50218258] [2023-11-06 22:08:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:12,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:12,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:12,906 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:12,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:08:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:13,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:08:13,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:13,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:08:13,252 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:08:13,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:08:13,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:08:13,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:08:13,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:08:13,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:08:13,522 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 22:08:13,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-06 22:08:13,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2023-11-06 22:08:14,589 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-06 22:08:14,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 49 [2023-11-06 22:08:14,620 INFO L322 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2023-11-06 22:08:14,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2023-11-06 22:08:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:14,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:16,199 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:16,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 264 treesize of output 328 [2023-11-06 22:08:19,344 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (and (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse0 (select (select .cse7 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse0 4))) (let ((.cse5 (select (select .cse7 .cse3) .cse4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse1 (select (select .cse1 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse2 .cse3) .cse4)) (< .cse5 .cse6) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (= .cse5 0))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse8 (select (select .cse12 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse11 (select (select .cse14 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse8 4))) (let ((.cse10 (select (select .cse14 .cse11) .cse13))) (or (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse9 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse10) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11)) (= (select (select .cse12 .cse11) .cse13) 0) (= .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (or (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse15 (select (select .cse15 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse16 (select (select .cse19 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse19 .cse16) (+ .cse18 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16)) (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse18)) (= .cse17 0))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse22 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse24 .cse22) (+ .cse23 4)))) (or (= .cse20 (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse21 (select (select .cse21 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse22)) (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse23)) (= .cse20 0)))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse28 (select (select .cse29 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse27 (select (select .cse31 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (+ .cse28 4))) (let ((.cse25 (select (select .cse31 .cse27) .cse30))) (or (= .cse25 (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse26 (select (select .cse26 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse27)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse28)) (< (select (select .cse29 .cse27) .cse30) .cse6) (= .cse25 0))))))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (select (select .cse35 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse33 .cse6) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse34)) (= .cse33 0)))))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (select (select .cse38 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse37)) (< 0 (+ (select (select .cse38 .cse37) (+ .cse36 4)) 5)))))) (or (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse39 (select (select .cse39 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse40 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse40)) (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse41 (select (select .cse43 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse43 .cse40) (+ .cse41 4)))) (or (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse42 .cse6) (= .cse42 0))))))))) (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse46 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse44 (select (select .cse45 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse47 (+ .cse44 4))) (or (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse45 .cse46) .cse47) 0) (= (select (select .cse48 .cse46) .cse47) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse50 (select (select .cse51 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse49 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (+ .cse50 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse49)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse50)) (< (select (select .cse51 .cse49) .cse52) .cse6) (= (select (select .cse53 .cse49) .cse52) 0)))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse57 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse55 (select (select .cse56 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse58 (+ .cse55 4))) (let ((.cse54 (select (select .cse59 .cse57) .cse58))) (or (= .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse55)) (< (select (select .cse56 .cse57) .cse58) .cse6) (= .cse54 0))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse57)))))))) is different from false [2023-11-06 22:08:20,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse62 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse62 0))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse62 0)))) (and (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse2 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ 5 (select (select .cse0 .cse1) (+ .cse2 4)))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse9 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse7 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse9 .cse7) (+ .cse8 4)))) (or (= (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse5 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6) (= .cse6 0) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse8)) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse12 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse15 (select (select .cse12 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse13 (select (select .cse16 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ 4 .cse15))) (let ((.cse10 (select (select .cse16 .cse13) .cse14))) (or (= .cse10 (select (let ((.cse11 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse11 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= (select (select .cse12 .cse13) .cse14) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse15)) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select .cse19 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse20 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (+ .cse23 4))) (let ((.cse18 (select (select .cse24 .cse20) .cse21))) (or (= (select (let ((.cse17 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse17 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse18) (= .cse18 0) (< (select (select .cse19 .cse20) .cse21) .cse22) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse23)))))))) (or (and (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse29 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse26 (select (select .cse29 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse25 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse28 (select (select .cse25 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (+ 4 .cse28))) (or (= (select (select .cse25 .cse26) .cse27) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse28)) (= (select (select .cse29 .cse26) .cse27) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse33 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse32 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse31 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse30 (select (select .cse32 .cse33) (+ 4 .cse31)))) (or (< .cse30 .cse22) (= .cse30 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse31))))))) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse34 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse34 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse38 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse37 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (select (select .cse38 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (select (select .cse38 .cse37) (+ 4 .cse36)))) (or (< .cse35 .cse22) (= .cse35 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse36)) (not (= .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (or (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse42 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse40 (select (select .cse42 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (select (select .cse42 .cse40) (+ .cse41 4)))) (or (= .cse39 0) (not (= .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse41)) (= .cse39 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse43 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse43 (select (select .cse43 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse49 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse44 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse46 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse48 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse47 (+ .cse48 4))) (let ((.cse45 (select (select .cse49 .cse44) .cse47))) (or (= .cse45 0) (< (select (select .cse46 .cse44) .cse47) .cse22) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse48)) (= .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse53 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse50 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3)) (.cse54 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse52 (+ .cse54 4)) (.cse51 (select (select .cse50 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse50 .cse51) .cse52) 0) (< (select (select .cse53 .cse51) .cse52) .cse22) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse54))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse61 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse60 (select (select .cse61 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse56 (select (select .cse55 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ 4 .cse60))) (let ((.cse59 (select (select .cse61 .cse56) .cse57))) (or (= (select (select .cse55 .cse56) .cse57) (select (let ((.cse58 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse58 (select (select .cse58 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< .cse59 .cse22) (= .cse59 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse60)) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) is different from false [2023-11-06 22:08:20,295 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2023-11-06 22:08:20,310 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2023-11-06 22:08:20,529 INFO L322 Elim1Store]: treesize reduction 116, result has 48.4 percent of original size [2023-11-06 22:08:20,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 268 treesize of output 308 [2023-11-06 22:08:20,667 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 222 treesize of output 278 [2023-11-06 22:08:20,740 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:20,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 224 [2023-11-06 22:08:20,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2023-11-06 22:08:24,255 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,255 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2023-11-06 22:08:24,267 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,268 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2023-11-06 22:08:24,281 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 1 [2023-11-06 22:08:24,294 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,294 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2023-11-06 22:08:24,308 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,308 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2023-11-06 22:08:24,322 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,323 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2023-11-06 22:08:24,340 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,340 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2023-11-06 22:08:24,352 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,353 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2023-11-06 22:08:24,365 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:08:24,366 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2023-11-06 22:08:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:08:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50218258] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:24,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 50 [2023-11-06 22:08:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69562478] [2023-11-06 22:08:24,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-06 22:08:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-06 22:08:24,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2198, Unknown=2, NotChecked=190, Total=2550 [2023-11-06 22:08:24,648 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 51 states, 50 states have (on average 1.8) internal successors, (90), 51 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-06 22:08:25,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse65 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse25 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse65 0))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 .cse65 0)))) (and (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse2 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ 5 (select (select .cse0 .cse1) (+ .cse2 4)))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse9 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse7 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse9 .cse7) (+ .cse8 4)))) (or (= (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse5 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6) (= .cse6 0) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse8)) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse10 .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse14 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse17 (select (select .cse14 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse15 (select (select .cse18 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse17))) (let ((.cse12 (select (select .cse18 .cse15) .cse16))) (or (= .cse12 (select (let ((.cse13 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse13 (select (select .cse13 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= (select (select .cse14 .cse15) .cse16) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse17)) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (= (select .cse19 .cse11) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse22 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse26 (select (select .cse22 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse23 (select (select .cse27 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (+ .cse26 4))) (let ((.cse21 (select (select .cse27 .cse23) .cse24))) (or (= (select (let ((.cse20 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse20 (select (select .cse20 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse21) (= .cse21 0) (< (select (select .cse22 .cse23) .cse24) .cse25) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse26)))))))) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (and (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse32 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse29 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse28 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse31 (select (select .cse28 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse30 (+ 4 .cse31))) (or (= (select (select .cse28 .cse29) .cse30) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse31)) (= (select (select .cse32 .cse29) .cse30) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse36 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse35 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse34 (select (select .cse35 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse36) (+ 4 .cse34)))) (or (< .cse33 .cse25) (= .cse33 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse34))))))) (not (= .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse37 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse37 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse40 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select (select .cse41 .cse40) (+ 4 .cse39)))) (or (< .cse38 .cse25) (= .cse38 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (not (= .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (or (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse45 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse43 (select (select .cse45 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse45 .cse43) (+ .cse44 4)))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse44)) (= .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse46 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse46 (select (select .cse46 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse52 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse52 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse49 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse51 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (+ .cse51 4))) (let ((.cse48 (select (select .cse52 .cse47) .cse50))) (or (= .cse48 0) (< (select (select .cse49 .cse47) .cse50) .cse25) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse51)) (= .cse48 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (= (select .cse10 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse19 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse56 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse53 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3)) (.cse57 (select (select .cse56 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse55 (+ .cse57 4)) (.cse54 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse53 .cse54) .cse55) 0) (< (select (select .cse56 .cse54) .cse55) .cse25) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse57))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse64 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse63 (select (select .cse64 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse59 (select (select .cse58 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse60 (+ 4 .cse63))) (let ((.cse62 (select (select .cse64 .cse59) .cse60))) (or (= (select (select .cse58 .cse59) .cse60) (select (let ((.cse61 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< .cse62 .cse25) (= .cse62 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse63)) (not (= .cse59 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) is different from false [2023-11-06 22:08:27,340 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse69 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse14 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (select .cse11 .cse69)) (.cse28 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse13 .cse70 0))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse22 .cse70 0))) (.cse31 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse2 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ 5 (select (select .cse0 .cse1) (+ .cse2 4)))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse9 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse7 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse9 .cse7) (+ .cse8 4)))) (or (= (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse5 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6) (= .cse6 0) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse8)) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse11 .cse12) 0) (= (select .cse13 .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse17 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse20 (select (select .cse17 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse18 (select (select .cse21 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ 4 .cse20))) (let ((.cse15 (select (select .cse21 .cse18) .cse19))) (or (= .cse15 (select (let ((.cse16 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse16 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= (select (select .cse17 .cse18) .cse19) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse20)) (not (= .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (= (select .cse22 .cse14) 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse25 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse29 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse26 (select (select .cse30 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (+ .cse29 4))) (let ((.cse24 (select (select .cse30 .cse26) .cse27))) (or (= (select (let ((.cse23 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse23 (select (select .cse23 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse24) (= .cse24 0) (< (select (select .cse25 .cse26) .cse27) .cse28) (not (= .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse29)))))))) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#length| (select .cse11 4)) 12) (= (select .cse31 4) 0) (or (and (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse36 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse33 (select (select .cse36 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse32 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse35 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (+ 4 .cse35))) (or (= (select (select .cse32 .cse33) .cse34) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse35)) (= (select (select .cse36 .cse33) .cse34) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse40 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1303 (Array Int Int))) (let ((.cse39 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse38 (select (select .cse39 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (select (select .cse39 .cse40) (+ 4 .cse38)))) (or (< .cse37 .cse28) (= .cse37 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse38))))))) (not (= .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse41 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse41 (select (select .cse41 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse45 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse44 (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse43 (select (select .cse45 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse45 .cse44) (+ 4 .cse43)))) (or (< .cse42 .cse28) (= .cse42 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse43)) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (or (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse49 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select (select .cse49 .cse47) (+ .cse48 4)))) (or (= .cse46 0) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse48)) (= .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (= (select (let ((.cse50 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (select .cse50 (select (select .cse50 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse56 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse51 (select (select .cse56 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse53 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse55 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse54 (+ .cse55 4))) (let ((.cse52 (select (select .cse56 .cse51) .cse54))) (or (= .cse52 0) (< (select (select .cse53 .cse51) .cse54) .cse28) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse55)) (= .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (= (select .cse31 .cse12) 0) (= (select .cse13 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 12 (select |c_#length| .cse10)) (= (select .cse22 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse60 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse57 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3)) (.cse61 (select (select .cse60 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse59 (+ .cse61 4)) (.cse58 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse57 .cse58) .cse59) 0) (< (select (select .cse60 .cse58) .cse59) .cse28) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse61))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse68 (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1303))) (let ((.cse67 (select (select .cse68 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1302))) (let ((.cse63 (select (select .cse62 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ 4 .cse67))) (let ((.cse66 (select (select .cse68 .cse63) .cse64))) (or (= (select (select .cse62 .cse63) .cse64) (select (let ((.cse65 (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse65 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< .cse66 .cse28) (= .cse66 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)) (not (= .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (= (select .cse31 .cse69) 0)))) is different from false [2023-11-06 22:08:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:31,602 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2023-11-06 22:08:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:08:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.8) internal successors, (90), 51 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) Word has length 31 [2023-11-06 22:08:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:31,604 INFO L225 Difference]: With dead ends: 178 [2023-11-06 22:08:31,605 INFO L226 Difference]: Without dead ends: 178 [2023-11-06 22:08:31,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=538, Invalid=4721, Unknown=13, NotChecked=580, Total=5852 [2023-11-06 22:08:31,608 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 489 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 443 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:31,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 653 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1266 Invalid, 0 Unknown, 443 Unchecked, 1.8s Time] [2023-11-06 22:08:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-06 22:08:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 79. [2023-11-06 22:08:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-11-06 22:08:31,612 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2023-11-06 22:08:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:31,612 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-11-06 22:08:31,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.8) internal successors, (90), 51 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-06 22:08:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-11-06 22:08:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:08:31,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:31,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:31,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:31,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:31,819 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:31,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1649773349, now seen corresponding path program 1 times [2023-11-06 22:08:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208304685] [2023-11-06 22:08:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208304685] [2023-11-06 22:08:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208304685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040890058] [2023-11-06 22:08:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:31,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:31,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:08:31,913 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:31,973 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-06 22:08:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:08:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-06 22:08:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:31,974 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:08:31,974 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:08:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:31,975 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:31,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 50 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:08:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 22:08:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-11-06 22:08:31,979 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 33 [2023-11-06 22:08:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:31,979 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-11-06 22:08:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-11-06 22:08:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:08:31,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:31,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:08:31,980 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:31,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -818501958, now seen corresponding path program 1 times [2023-11-06 22:08:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250579138] [2023-11-06 22:08:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250579138] [2023-11-06 22:08:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250579138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327183187] [2023-11-06 22:08:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:32,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:32,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:32,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:08:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:32,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:08:32,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:32,323 INFO L351 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 17 treesize of output 9 [2023-11-06 22:08:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:32,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:32,357 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 22:08:32,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:08:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327183187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:32,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-11-06 22:08:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879669165] [2023-11-06 22:08:32,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:08:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:08:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:32,363 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:32,521 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-11-06 22:08:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:08:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-06 22:08:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:32,522 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:08:32,522 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:08:32,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:32,523 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:32,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:08:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2023-11-06 22:08:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-11-06 22:08:32,525 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 33 [2023-11-06 22:08:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:32,527 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-11-06 22:08:32,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-11-06 22:08:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:08:32,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:32,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:32,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:32,729 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:32,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash -818501957, now seen corresponding path program 1 times [2023-11-06 22:08:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393836982] [2023-11-06 22:08:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393836982] [2023-11-06 22:08:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393836982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166277119] [2023-11-06 22:08:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:33,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:33,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:08:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:33,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:08:33,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:33,549 INFO L351 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 23 treesize of output 15 [2023-11-06 22:08:33,553 INFO L351 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 19 treesize of output 11 [2023-11-06 22:08:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:33,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:33,834 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:33,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2023-11-06 22:08:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:08:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166277119] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:33,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2023-11-06 22:08:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772164544] [2023-11-06 22:08:33,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:08:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:08:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:08:33,892 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:35,042 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-11-06 22:08:35,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:08:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-06 22:08:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:35,044 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:08:35,044 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:08:35,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2023-11-06 22:08:35,046 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 232 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:35,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 233 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:08:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:08:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2023-11-06 22:08:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-11-06 22:08:35,050 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 33 [2023-11-06 22:08:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:35,050 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-11-06 22:08:35,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-11-06 22:08:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:08:35,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:35,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:35,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:35,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:35,257 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:35,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash 396633763, now seen corresponding path program 1 times [2023-11-06 22:08:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638552703] [2023-11-06 22:08:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638552703] [2023-11-06 22:08:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638552703] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290780825] [2023-11-06 22:08:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:36,742 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:36,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:08:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:36,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 22:08:36,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:37,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:08:37,154 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:08:37,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:08:37,245 INFO L351 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-06 22:08:37,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:08:37,399 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:08:37,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2023-11-06 22:08:37,929 INFO L322 Elim1Store]: treesize reduction 8, result has 84.3 percent of original size [2023-11-06 22:08:37,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 63 [2023-11-06 22:08:38,098 INFO L351 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 16 treesize of output 8 [2023-11-06 22:08:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:38,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:38,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 22:08:38,903 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:38,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2023-11-06 22:08:38,974 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:38,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 199 [2023-11-06 22:08:39,009 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:39,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 116 [2023-11-06 22:08:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290780825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:41,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 50 [2023-11-06 22:08:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040770854] [2023-11-06 22:08:41,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:41,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:08:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:08:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2286, Unknown=22, NotChecked=0, Total=2450 [2023-11-06 22:08:41,113 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:43,498 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-11-06 22:08:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:08:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-06 22:08:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:43,501 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:08:43,501 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 22:08:43,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=499, Invalid=4171, Unknown=22, NotChecked=0, Total=4692 [2023-11-06 22:08:43,503 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 281 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:43,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 745 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:08:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 22:08:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2023-11-06 22:08:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.25) internal successors, (85), 78 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-06 22:08:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-11-06 22:08:43,507 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 34 [2023-11-06 22:08:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:43,508 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-11-06 22:08:43,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-11-06 22:08:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:08:43,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:43,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:43,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:43,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:43,721 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:08:43,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -601364006, now seen corresponding path program 1 times [2023-11-06 22:08:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:43,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925750972] [2023-11-06 22:08:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925750972] [2023-11-06 22:08:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925750972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427867945] [2023-11-06 22:08:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:44,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:44,655 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:44,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d12a2f4-89a1-4ad8-ba6a-e49e4f323491/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:08:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-06 22:08:44,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:44,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:08:45,104 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:08:45,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:08:45,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:08:45,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:08:45,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-06 22:08:49,688 INFO L322 Elim1Store]: treesize reduction 128, result has 90.3 percent of original size [2023-11-06 22:08:49,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 351 treesize of output 1341 [2023-11-06 22:08:50,146 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:50,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 1287 treesize of output 1159