./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:02:49,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:02:49,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 21:02:49,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:02:49,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:02:49,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:02:49,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:02:49,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:02:49,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:02:49,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:02:49,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:02:49,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:02:49,348 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:02:49,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:02:49,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:02:49,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:02:49,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:02:49,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:02:49,353 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 21:02:49,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 21:02:49,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 21:02:49,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:02:49,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 21:02:49,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:02:49,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:02:49,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:02:49,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:02:49,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:02:49,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:02:49,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:02:49,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:02:49,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:02:49,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:02:49,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:02:49,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:02:49,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:02:49,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:02:49,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:02:49,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:02:49,365 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_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-11-21 21:02:49,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:02:49,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:02:49,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:02:49,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:02:49,747 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:02:49,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-21 21:02:53,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:02:53,416 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:02:53,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-11-21 21:02:53,439 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/data/12a26e225/6b8da9b9b1c74dd894989b6c0cb0ada5/FLAG672474c86 [2023-11-21 21:02:53,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/data/12a26e225/6b8da9b9b1c74dd894989b6c0cb0ada5 [2023-11-21 21:02:53,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:02:53,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:02:53,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:02:53,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:02:53,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:02:53,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:53,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ea50e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53, skipping insertion in model container [2023-11-21 21:02:53,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:53,548 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:02:53,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:02:53,878 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:02:53,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:02:53,963 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:02:53,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53 WrapperNode [2023-11-21 21:02:53,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:02:53,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:02:53,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:02:53,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:02:53,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:53,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,015 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-21 21:02:54,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:02:54,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:02:54,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:02:54,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:02:54,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:02:54,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:02:54,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:02:54,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:02:54,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (1/1) ... [2023-11-21 21:02:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:02:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:02:54,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:02:54,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:02:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-21 21:02:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-21 21:02:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 21:02:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:02:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:02:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:02:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 21:02:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 21:02:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:02:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:02:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:02:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:02:54,313 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:02:54,316 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:02:54,911 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:02:54,987 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:02:54,988 INFO L308 CfgBuilder]: Removed 15 assume(true) statements. [2023-11-21 21:02:54,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:02:54 BoogieIcfgContainer [2023-11-21 21:02:54,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:02:54,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:02:54,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:02:54,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:02:55,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:02:53" (1/3) ... [2023-11-21 21:02:55,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c67ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:02:55, skipping insertion in model container [2023-11-21 21:02:55,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:02:53" (2/3) ... [2023-11-21 21:02:55,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c67ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:02:55, skipping insertion in model container [2023-11-21 21:02:55,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:02:54" (3/3) ... [2023-11-21 21:02:55,005 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-11-21 21:02:55,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:02:55,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-11-21 21:02:55,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:02:55,109 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;@6d1545c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:02:55,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-21 21:02:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 21:02:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 21:02:55,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:55,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 21:02:55,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:55,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash 9685, now seen corresponding path program 1 times [2023-11-21 21:02:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:55,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452770007] [2023-11-21 21:02:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:55,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:55,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452770007] [2023-11-21 21:02:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452770007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:02:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684835772] [2023-11-21 21:02:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:55,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:55,569 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 21:02:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:55,770 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-11-21 21:02:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 21:02:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:55,788 INFO L225 Difference]: With dead ends: 136 [2023-11-21 21:02:55,789 INFO L226 Difference]: Without dead ends: 135 [2023-11-21 21:02:55,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:55,798 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:55,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:02:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-21 21:02:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-11-21 21:02:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-11-21 21:02:55,872 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-11-21 21:02:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:55,873 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-11-21 21:02:55,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 21:02:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-11-21 21:02:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 21:02:55,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:55,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 21:02:55,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:02:55,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:55,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash 9686, now seen corresponding path program 1 times [2023-11-21 21:02:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188828181] [2023-11-21 21:02:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:56,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188828181] [2023-11-21 21:02:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188828181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:56,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:56,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:02:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35571551] [2023-11-21 21:02:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:02:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:02:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:56,067 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 21:02:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:56,242 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2023-11-21 21:02:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:02:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 21:02:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:56,251 INFO L225 Difference]: With dead ends: 118 [2023-11-21 21:02:56,251 INFO L226 Difference]: Without dead ends: 118 [2023-11-21 21:02:56,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:02:56,260 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:56,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 169 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:02:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-21 21:02:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2023-11-21 21:02:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-11-21 21:02:56,284 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-11-21 21:02:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:56,284 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-11-21 21:02:56,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 21:02:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-11-21 21:02:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 21:02:56,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:56,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:02:56,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:56,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866331, now seen corresponding path program 1 times [2023-11-21 21:02:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090516014] [2023-11-21 21:02:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:56,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090516014] [2023-11-21 21:02:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090516014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:56,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:02:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616437586] [2023-11-21 21:02:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:02:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:02:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:02:56,420 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-21 21:02:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:56,665 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-21 21:02:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:56,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-21 21:02:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:56,668 INFO L225 Difference]: With dead ends: 116 [2023-11-21 21:02:56,669 INFO L226 Difference]: Without dead ends: 116 [2023-11-21 21:02:56,670 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-21 21:02:56,682 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:56,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-21 21:02:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-11-21 21:02:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-21 21:02:56,706 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-11-21 21:02:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:56,708 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-21 21:02:56,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-21 21:02:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-21 21:02:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 21:02:56,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:56,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:56,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:02:56,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:56,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866330, now seen corresponding path program 1 times [2023-11-21 21:02:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888401274] [2023-11-21 21:02:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888401274] [2023-11-21 21:02:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888401274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:57,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:57,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:02:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317142367] [2023-11-21 21:02:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:57,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:02:57,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:02:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:02:57,002 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 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-21 21:02:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:57,189 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-11-21 21:02:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-21 21:02:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:57,191 INFO L225 Difference]: With dead ends: 112 [2023-11-21 21:02:57,191 INFO L226 Difference]: Without dead ends: 112 [2023-11-21 21:02:57,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-21 21:02:57,193 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:57,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-21 21:02:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2023-11-21 21:02:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 105 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-11-21 21:02:57,202 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 7 [2023-11-21 21:02:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:57,202 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-11-21 21:02:57,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-21 21:02:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-11-21 21:02:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 21:02:57,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:57,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:57,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:02:57,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:57,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866307, now seen corresponding path program 1 times [2023-11-21 21:02:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14498148] [2023-11-21 21:02:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14498148] [2023-11-21 21:02:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14498148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:57,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:57,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:02:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177816874] [2023-11-21 21:02:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:57,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:02:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:02:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:57,519 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-21 21:02:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:57,885 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2023-11-21 21:02:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:02:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-21 21:02:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:57,887 INFO L225 Difference]: With dead ends: 180 [2023-11-21 21:02:57,887 INFO L226 Difference]: Without dead ends: 180 [2023-11-21 21:02:57,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:02:57,889 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:57,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 93 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:02:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-21 21:02:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2023-11-21 21:02:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.670731707317073) internal successors, (137), 124 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-11-21 21:02:57,898 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 7 [2023-11-21 21:02:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-11-21 21:02:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-21 21:02:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-11-21 21:02:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 21:02:57,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:57,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:57,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:02:57,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:57,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222096, now seen corresponding path program 1 times [2023-11-21 21:02:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138020031] [2023-11-21 21:02:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138020031] [2023-11-21 21:02:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138020031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:58,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:02:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197061134] [2023-11-21 21:02:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:58,048 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:58,223 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2023-11-21 21:02:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:58,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:58,229 INFO L225 Difference]: With dead ends: 125 [2023-11-21 21:02:58,229 INFO L226 Difference]: Without dead ends: 125 [2023-11-21 21:02:58,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:58,232 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:58,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-21 21:02:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-21 21:02:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.646341463414634) internal successors, (135), 123 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-11-21 21:02:58,251 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2023-11-21 21:02:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:58,252 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-11-21 21:02:58,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-11-21 21:02:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 21:02:58,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:58,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:58,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:02:58,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:58,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222095, now seen corresponding path program 1 times [2023-11-21 21:02:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394243848] [2023-11-21 21:02:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394243848] [2023-11-21 21:02:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394243848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:02:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343451123] [2023-11-21 21:02:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:58,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:58,507 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:58,696 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2023-11-21 21:02:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:58,699 INFO L225 Difference]: With dead ends: 124 [2023-11-21 21:02:58,699 INFO L226 Difference]: Without dead ends: 124 [2023-11-21 21:02:58,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:58,700 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:58,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-21 21:02:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-21 21:02:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 122 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2023-11-21 21:02:58,714 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 9 [2023-11-21 21:02:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:58,714 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2023-11-21 21:02:58,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-21 21:02:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2023-11-21 21:02:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 21:02:58,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:58,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:58,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:02:58,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:58,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224648, now seen corresponding path program 1 times [2023-11-21 21:02:58,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:58,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933091685] [2023-11-21 21:02:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933091685] [2023-11-21 21:02:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933091685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:02:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374072308] [2023-11-21 21:02:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:58,908 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:59,064 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-11-21 21:02:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 21:02:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:59,066 INFO L225 Difference]: With dead ends: 123 [2023-11-21 21:02:59,066 INFO L226 Difference]: Without dead ends: 123 [2023-11-21 21:02:59,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:59,068 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:59,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:02:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-21 21:02:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-21 21:02:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 121 states have internal predecessors, (131), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2023-11-21 21:02:59,074 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 10 [2023-11-21 21:02:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:59,075 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2023-11-21 21:02:59,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2023-11-21 21:02:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 21:02:59,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:59,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:59,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:02:59,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:59,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224649, now seen corresponding path program 1 times [2023-11-21 21:02:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291753190] [2023-11-21 21:02:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291753190] [2023-11-21 21:02:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291753190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:02:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783902229] [2023-11-21 21:02:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:59,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:02:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:59,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:02:59,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:02:59,353 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:59,549 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-11-21 21:02:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:02:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 21:02:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:02:59,551 INFO L225 Difference]: With dead ends: 122 [2023-11-21 21:02:59,551 INFO L226 Difference]: Without dead ends: 122 [2023-11-21 21:02:59,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:02:59,552 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:02:59,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:02:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-21 21:02:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-21 21:02:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 120 states have internal predecessors, (129), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-11-21 21:02:59,557 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 10 [2023-11-21 21:02:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:02:59,557 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-11-21 21:02:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-11-21 21:02:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 21:02:59,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:02:59,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:59,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:02:59,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:02:59,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 327030838, now seen corresponding path program 1 times [2023-11-21 21:02:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179005279] [2023-11-21 21:02:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179005279] [2023-11-21 21:02:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179005279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:02:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:02:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:02:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261054807] [2023-11-21 21:02:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:02:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 21:02:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 21:02:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:02:59,782 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-21 21:03:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:00,152 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-11-21 21:03:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:03:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2023-11-21 21:03:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:00,154 INFO L225 Difference]: With dead ends: 128 [2023-11-21 21:03:00,154 INFO L226 Difference]: Without dead ends: 128 [2023-11-21 21:03:00,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-21 21:03:00,155 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 149 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:00,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 180 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:03:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-21 21:03:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2023-11-21 21:03:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 119 states have internal predecessors, (128), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2023-11-21 21:03:00,160 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 11 [2023-11-21 21:03:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:00,160 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2023-11-21 21:03:00,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-21 21:03:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2023-11-21 21:03:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 21:03:00,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:00,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:00,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:03:00,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:00,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash 327030839, now seen corresponding path program 1 times [2023-11-21 21:03:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:00,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842384540] [2023-11-21 21:03:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:00,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842384540] [2023-11-21 21:03:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842384540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 21:03:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996682292] [2023-11-21 21:03:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:00,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:00,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:00,542 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-21 21:03:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:01,040 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-11-21 21:03:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 21:03:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2023-11-21 21:03:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:01,041 INFO L225 Difference]: With dead ends: 123 [2023-11-21 21:03:01,041 INFO L226 Difference]: Without dead ends: 123 [2023-11-21 21:03:01,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-21 21:03:01,042 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:01,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:03:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-21 21:03:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2023-11-21 21:03:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 100 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-11-21 21:03:01,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2023-11-21 21:03:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:01,047 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-11-21 21:03:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-21 21:03:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-11-21 21:03:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-21 21:03:01,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:01,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:01,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:03:01,048 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:01,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 164325843, now seen corresponding path program 1 times [2023-11-21 21:03:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618540594] [2023-11-21 21:03:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618540594] [2023-11-21 21:03:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618540594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:01,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:03:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033405098] [2023-11-21 21:03:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:01,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:03:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:01,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:03:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:03:01,225 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:01,374 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-11-21 21:03:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:03:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-21 21:03:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:01,376 INFO L225 Difference]: With dead ends: 101 [2023-11-21 21:03:01,376 INFO L226 Difference]: Without dead ends: 101 [2023-11-21 21:03:01,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:01,377 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:01,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:03:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-21 21:03:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-21 21:03:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-11-21 21:03:01,382 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 12 [2023-11-21 21:03:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:01,382 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-11-21 21:03:01,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-11-21 21:03:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-21 21:03:01,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:01,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:01,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:03:01,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:01,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash 164325844, now seen corresponding path program 1 times [2023-11-21 21:03:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679393781] [2023-11-21 21:03:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679393781] [2023-11-21 21:03:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679393781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:03:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345666985] [2023-11-21 21:03:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:01,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:01,792 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:02,168 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2023-11-21 21:03:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:03:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-21 21:03:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:02,172 INFO L225 Difference]: With dead ends: 160 [2023-11-21 21:03:02,172 INFO L226 Difference]: Without dead ends: 160 [2023-11-21 21:03:02,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:03:02,173 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 161 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:02,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 232 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:03:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-21 21:03:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2023-11-21 21:03:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 107 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-11-21 21:03:02,177 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 12 [2023-11-21 21:03:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:02,177 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-11-21 21:03:02,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-11-21 21:03:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 21:03:02,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:02,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:02,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:03:02,179 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:02,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2042218147, now seen corresponding path program 1 times [2023-11-21 21:03:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351952667] [2023-11-21 21:03:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351952667] [2023-11-21 21:03:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351952667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 21:03:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779648370] [2023-11-21 21:03:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:02,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:02,389 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:02,731 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-21 21:03:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 21:03:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 21:03:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:02,732 INFO L225 Difference]: With dead ends: 119 [2023-11-21 21:03:02,732 INFO L226 Difference]: Without dead ends: 119 [2023-11-21 21:03:02,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-21 21:03:02,733 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 139 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:02,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 175 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:03:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-21 21:03:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2023-11-21 21:03:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2023-11-21 21:03:02,737 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 15 [2023-11-21 21:03:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:02,738 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-11-21 21:03:02,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2023-11-21 21:03:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 21:03:02,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:02,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:02,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:03:02,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:02,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 174750842, now seen corresponding path program 1 times [2023-11-21 21:03:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:02,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377531517] [2023-11-21 21:03:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:02,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:02,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377531517] [2023-11-21 21:03:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377531517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374140872] [2023-11-21 21:03:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:02,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:03:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:03:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:03:02,804 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:02,915 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2023-11-21 21:03:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:03:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-21 21:03:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:02,921 INFO L225 Difference]: With dead ends: 157 [2023-11-21 21:03:02,921 INFO L226 Difference]: Without dead ends: 157 [2023-11-21 21:03:02,923 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-21 21:03:02,923 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:02,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 124 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:03:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-21 21:03:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2023-11-21 21:03:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-11-21 21:03:02,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 16 [2023-11-21 21:03:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:02,929 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-11-21 21:03:02,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-11-21 21:03:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:03:02,934 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:02,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:02,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:03:02,934 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:02,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -622081400, now seen corresponding path program 1 times [2023-11-21 21:03:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:02,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660640710] [2023-11-21 21:03:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660640710] [2023-11-21 21:03:03,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660640710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:03,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:03,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:03:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968604553] [2023-11-21 21:03:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:03,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:03:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:03:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:03:03,007 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:03,122 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-11-21 21:03:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:03:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-21 21:03:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:03,123 INFO L225 Difference]: With dead ends: 106 [2023-11-21 21:03:03,123 INFO L226 Difference]: Without dead ends: 106 [2023-11-21 21:03:03,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:03:03,124 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:03,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 199 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:03:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-21 21:03:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-21 21:03:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2023-11-21 21:03:03,128 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2023-11-21 21:03:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:03,128 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2023-11-21 21:03:03,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2023-11-21 21:03:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:03:03,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:03,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:03:03,131 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:03,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash -590564444, now seen corresponding path program 1 times [2023-11-21 21:03:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063603104] [2023-11-21 21:03:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063603104] [2023-11-21 21:03:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063603104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 21:03:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028326026] [2023-11-21 21:03:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:03,588 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:03,854 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2023-11-21 21:03:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:03:03,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-21 21:03:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:03,855 INFO L225 Difference]: With dead ends: 134 [2023-11-21 21:03:03,855 INFO L226 Difference]: Without dead ends: 134 [2023-11-21 21:03:03,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:03:03,856 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:03,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 252 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:03:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-21 21:03:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2023-11-21 21:03:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2023-11-21 21:03:03,860 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 21 [2023-11-21 21:03:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:03,861 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2023-11-21 21:03:03,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2023-11-21 21:03:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:03:03,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:03,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:03,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:03:03,862 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:03,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash -622050630, now seen corresponding path program 1 times [2023-11-21 21:03:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591021957] [2023-11-21 21:03:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591021957] [2023-11-21 21:03:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591021957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:04,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 21:03:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548540830] [2023-11-21 21:03:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:04,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:04,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:04,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:04,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:04,228 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:04,551 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2023-11-21 21:03:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:03:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:04,553 INFO L225 Difference]: With dead ends: 136 [2023-11-21 21:03:04,553 INFO L226 Difference]: Without dead ends: 136 [2023-11-21 21:03:04,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:03:04,554 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 136 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:04,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 169 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:03:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-21 21:03:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 115. [2023-11-21 21:03:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 113 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2023-11-21 21:03:04,558 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2023-11-21 21:03:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:04,558 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2023-11-21 21:03:04,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2023-11-21 21:03:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:03:04,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:04,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:04,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:03:04,560 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:04,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash -622050629, now seen corresponding path program 1 times [2023-11-21 21:03:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871657838] [2023-11-21 21:03:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871657838] [2023-11-21 21:03:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871657838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 21:03:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611793610] [2023-11-21 21:03:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:03:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:03:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:03:05,123 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:05,438 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2023-11-21 21:03:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:03:05,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:05,442 INFO L225 Difference]: With dead ends: 139 [2023-11-21 21:03:05,442 INFO L226 Difference]: Without dead ends: 139 [2023-11-21 21:03:05,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:03:05,443 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:05,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 244 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:03:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-21 21:03:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2023-11-21 21:03:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.375) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-11-21 21:03:05,447 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 21 [2023-11-21 21:03:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:05,448 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-11-21 21:03:05,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-21 21:03:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-11-21 21:03:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 21:03:05,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:05,449 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:05,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 21:03:05,449 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:05,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash -763714707, now seen corresponding path program 1 times [2023-11-21 21:03:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884763700] [2023-11-21 21:03:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 21:03:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884763700] [2023-11-21 21:03:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884763700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:06,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:06,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-21 21:03:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326202919] [2023-11-21 21:03:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:06,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-21 21:03:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 21:03:06,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:03:06,078 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:06,674 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-11-21 21:03:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:03:06,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-21 21:03:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:06,676 INFO L225 Difference]: With dead ends: 121 [2023-11-21 21:03:06,676 INFO L226 Difference]: Without dead ends: 121 [2023-11-21 21:03:06,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2023-11-21 21:03:06,677 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:06,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 326 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 21:03:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-21 21:03:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2023-11-21 21:03:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-11-21 21:03:06,681 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 21 [2023-11-21 21:03:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:06,681 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-11-21 21:03:06,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-11-21 21:03:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 21:03:06,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:06,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 21:03:06,683 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:06,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash 830531664, now seen corresponding path program 1 times [2023-11-21 21:03:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766627548] [2023-11-21 21:03:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766627548] [2023-11-21 21:03:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766627548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:07,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:03:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782193377] [2023-11-21 21:03:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:07,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:03:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:03:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:03:07,431 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:07,813 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-11-21 21:03:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 21:03:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-21 21:03:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:07,815 INFO L225 Difference]: With dead ends: 137 [2023-11-21 21:03:07,815 INFO L226 Difference]: Without dead ends: 137 [2023-11-21 21:03:07,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-21 21:03:07,816 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 175 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 303 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:03:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-21 21:03:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2023-11-21 21:03:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-21 21:03:07,821 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-11-21 21:03:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:07,821 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-21 21:03:07,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-21 21:03:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-21 21:03:07,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:07,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:07,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 21:03:07,825 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:07,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 228498532, now seen corresponding path program 1 times [2023-11-21 21:03:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879794235] [2023-11-21 21:03:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879794235] [2023-11-21 21:03:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879794235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678044657] [2023-11-21 21:03:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:03:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:03:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:03:07,936 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-21 21:03:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:08,074 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-21 21:03:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:03:08,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-21 21:03:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:03:08,078 INFO L225 Difference]: With dead ends: 131 [2023-11-21 21:03:08,078 INFO L226 Difference]: Without dead ends: 131 [2023-11-21 21:03:08,078 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-21 21:03:08,079 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:03:08,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:03:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-21 21:03:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-21 21:03:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:03:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-11-21 21:03:08,083 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2023-11-21 21:03:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:03:08,083 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-11-21 21:03:08,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-21 21:03:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-11-21 21:03:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-21 21:03:08,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:03:08,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 21:03:08,084 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 21:03:08,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1022216661, now seen corresponding path program 1 times [2023-11-21 21:03:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964055855] [2023-11-21 21:03:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:09,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964055855] [2023-11-21 21:03:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964055855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:03:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768680001] [2023-11-21 21:03:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:09,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:03:09,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:03:09,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:03:09,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e619293-9424-4ddd-9b06-cc869b55d6ef/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 21:03:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:09,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 21:03:09,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:03:09,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 21:03:09,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 21:03:09,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 21:03:09,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-21 21:03:09,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 21:03:09,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:03:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 21:03:09,820 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 21:03:09,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-21 21:03:09,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 21:03:09,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-21 21:03:09,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 21:03:10,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 21:03:10,070 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 21:03:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-21 21:03:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 21:03:10,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 21:03:10,274 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 21:03:10,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-21 21:03:10,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 21:03:10,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-21 21:03:10,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 21:03:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:03:10,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:03:10,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-21 21:03:10,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-21 21:03:10,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_905) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-21 21:03:10,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_905) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_904) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_906)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-11-21 21:03:10,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:03:10,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-11-21 21:03:10,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-11-21 21:03:10,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-21 21:03:13,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:03:13,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 137 [2023-11-21 21:03:13,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 233 [2023-11-21 21:03:13,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 213 [2023-11-21 21:03:14,122 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-21 21:03:14,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2023-11-21 21:03:14,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2023-11-21 21:03:28,385 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse13 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse0 (not .cse5)) (.cse24 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (and (or .cse0 (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_27)))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) .cse5) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_27)))))))) (or .cse5 (and .cse7 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (or .cse5 (and .cse7 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse11 (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (or .cse0 (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_27)))) (or (and (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse13) .cse5) (or (and .cse13 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse5) (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902))) (or (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20)))) .cse0) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_27)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= v_prenex_20 v_arrayElimCell_27))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (= v_prenex_20 v_arrayElimCell_27))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (and (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse24) .cse5) (or .cse0 (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))) (or .cse5 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|)))) (or .cse5 (and (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse27 (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_902))) (or (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_902) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) v_arrayElimCell_18 v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))) .cse24))))) is different from false