./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:41:13,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:41:13,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2023-11-06 22:41:13,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:41:13,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:41:13,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:41:13,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:41:13,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:41:13,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:41:13,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:41:13,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:41:13,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:41:13,731 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:41:13,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:41:13,733 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:41:13,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:41:13,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:41:13,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:41:13,735 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:41:13,736 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:41:13,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:41:13,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:41:13,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:41:13,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:41:13,738 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:41:13,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:41:13,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:41:13,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:41:13,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:13,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:41:13,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:41:13,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:41:13,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:41:13,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:41:13,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:41:13,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:41:13,744 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:41:13,745 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_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2023-11-06 22:41:14,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:41:14,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:41:14,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:41:14,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:41:14,082 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:41:14,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2023-11-06 22:41:17,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:41:17,451 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:41:17,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/sv-benchmarks/c/forester-heap/sll-circular-2.i [2023-11-06 22:41:17,466 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/data/325624984/df1c376ab9c949d3967e6e85fa983fa8/FLAG2b1379a13 [2023-11-06 22:41:17,481 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/data/325624984/df1c376ab9c949d3967e6e85fa983fa8 [2023-11-06 22:41:17,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:41:17,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:41:17,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:17,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:41:17,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:41:17,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:17,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5feeb5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17, skipping insertion in model container [2023-11-06 22:41:17,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:17,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:41:17,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:17,913 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:41:17,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:17,991 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:41:17,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17 WrapperNode [2023-11-06 22:41:17,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:17,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:17,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:41:17,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:41:18,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,051 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2023-11-06 22:41:18,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:18,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:41:18,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:41:18,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:41:18,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:41:18,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:41:18,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:41:18,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:41:18,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (1/1) ... [2023-11-06 22:41:18,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:18,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:18,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:18,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:41:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-06 22:41:18,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-06 22:41:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:41:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:41:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:41:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:41:18,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:41:18,293 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:41:18,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:41:18,703 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:41:18,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:41:18,710 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-06 22:41:18,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:18 BoogieIcfgContainer [2023-11-06 22:41:18,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:41:18,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:41:18,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:41:18,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:41:18,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:41:17" (1/3) ... [2023-11-06 22:41:18,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbeb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:18, skipping insertion in model container [2023-11-06 22:41:18,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:17" (2/3) ... [2023-11-06 22:41:18,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbeb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:18, skipping insertion in model container [2023-11-06 22:41:18,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:18" (3/3) ... [2023-11-06 22:41:18,737 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2023-11-06 22:41:18,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:41:18,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-06 22:41:18,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:41:18,837 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;@3c22b476, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:41:18,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-06 22:41:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 58 states have (on average 2.103448275862069) internal successors, (122), 102 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:41:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:41:18,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:18,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:41:18,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:18,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2023-11-06 22:41:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474029794] [2023-11-06 22:41:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474029794] [2023-11-06 22:41:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474029794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322498672] [2023-11-06 22:41:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:19,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:19,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:19,176 INFO L87 Difference]: Start difference. First operand has 107 states, 58 states have (on average 2.103448275862069) internal successors, (122), 102 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:19,352 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-11-06 22:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:41:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:19,365 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:41:19,365 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:41:19,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:19,371 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 83 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:19,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 81 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:41:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2023-11-06 22:41:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 94 states have internal predecessors, (101), 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-06 22:41:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-11-06 22:41:19,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 3 [2023-11-06 22:41:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:19,425 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-11-06 22:41:19,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-11-06 22:41:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:41:19,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:19,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:41:19,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:41:19,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:19,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2023-11-06 22:41:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089471909] [2023-11-06 22:41:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:19,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089471909] [2023-11-06 22:41:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089471909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:19,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:19,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897171160] [2023-11-06 22:41:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:19,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:19,615 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:19,734 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2023-11-06 22:41:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:41:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:19,739 INFO L225 Difference]: With dead ends: 104 [2023-11-06 22:41:19,739 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:41:19,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:19,746 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 81 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:19,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 81 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:41:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-11-06 22:41:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.830188679245283) internal successors, (97), 90 states have internal predecessors, (97), 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-06 22:41:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-11-06 22:41:19,769 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 3 [2023-11-06 22:41:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:19,769 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-11-06 22:41:19,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-11-06 22:41:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:41:19,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:19,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:19,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:41:19,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:19,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462876, now seen corresponding path program 1 times [2023-11-06 22:41:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498131117] [2023-11-06 22:41:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:19,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498131117] [2023-11-06 22:41:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498131117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:19,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34520856] [2023-11-06 22:41:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:19,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:19,896 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:20,022 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-11-06 22:41:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-06 22:41:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:20,024 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:41:20,024 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:41:20,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:20,025 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 133 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:20,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 57 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:41:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2023-11-06 22:41:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 79 states have internal predecessors, (86), 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-06 22:41:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-06 22:41:20,033 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 8 [2023-11-06 22:41:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:20,034 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-06 22:41:20,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-06 22:41:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:41:20,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:20,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:41:20,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:20,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462875, now seen corresponding path program 1 times [2023-11-06 22:41:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707086733] [2023-11-06 22:41:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707086733] [2023-11-06 22:41:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707086733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600911213] [2023-11-06 22:41:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:20,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:20,204 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:20,357 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-06 22:41:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:20,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-06 22:41:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:20,359 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:41:20,359 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:41:20,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:20,360 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 84 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:20,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:41:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2023-11-06 22:41:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 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-06 22:41:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2023-11-06 22:41:20,368 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 8 [2023-11-06 22:41:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:20,368 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2023-11-06 22:41:20,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2023-11-06 22:41:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:41:20,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:20,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:20,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:41:20,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:20,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -50514577, now seen corresponding path program 1 times [2023-11-06 22:41:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192442507] [2023-11-06 22:41:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:20,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192442507] [2023-11-06 22:41:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192442507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:20,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:20,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507749713] [2023-11-06 22:41:20,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:20,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:20,592 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:20,809 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-11-06 22:41:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:41:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:20,810 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:41:20,811 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:41:20,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:41:20,812 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:20,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 187 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:41:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:41:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 84 states have internal predecessors, (92), 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-06 22:41:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-11-06 22:41:20,819 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 12 [2023-11-06 22:41:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:20,819 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-11-06 22:41:20,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-11-06 22:41:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:41:20,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:20,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:20,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:41:20,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:20,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:20,822 INFO L85 PathProgramCache]: Analyzing trace with hash -50514576, now seen corresponding path program 1 times [2023-11-06 22:41:20,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:20,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461445957] [2023-11-06 22:41:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461445957] [2023-11-06 22:41:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461445957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762362410] [2023-11-06 22:41:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:21,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:21,094 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:21,383 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-06 22:41:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:21,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:41:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:21,385 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:41:21,385 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:41:21,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:21,386 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 21 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:21,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 245 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:41:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2023-11-06 22:41:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 73 states have internal predecessors, (80), 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-06 22:41:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-11-06 22:41:21,391 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 12 [2023-11-06 22:41:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:21,392 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-11-06 22:41:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-11-06 22:41:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:41:21,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:21,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:21,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:41:21,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:21,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1772967450, now seen corresponding path program 1 times [2023-11-06 22:41:21,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:21,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997133134] [2023-11-06 22:41:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997133134] [2023-11-06 22:41:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997133134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777949818] [2023-11-06 22:41:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:21,928 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:22,315 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2023-11-06 22:41:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2023-11-06 22:41:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:22,317 INFO L225 Difference]: With dead ends: 158 [2023-11-06 22:41:22,317 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:41:22,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:22,321 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:22,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 267 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:41:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:41:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2023-11-06 22:41:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 93 states have internal predecessors, (110), 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-06 22:41:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2023-11-06 22:41:22,333 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 13 [2023-11-06 22:41:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:22,334 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2023-11-06 22:41:22,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2023-11-06 22:41:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:41:22,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:22,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:22,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:41:22,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:22,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1772967451, now seen corresponding path program 1 times [2023-11-06 22:41:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593541438] [2023-11-06 22:41:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593541438] [2023-11-06 22:41:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593541438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619394133] [2023-11-06 22:41:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:22,600 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:22,886 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2023-11-06 22:41:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:22,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2023-11-06 22:41:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:22,888 INFO L225 Difference]: With dead ends: 135 [2023-11-06 22:41:22,888 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:41:22,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:41:22,890 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 291 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:22,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 205 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:41:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2023-11-06 22:41:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 93 states have internal predecessors, (109), 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-06 22:41:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-11-06 22:41:22,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 13 [2023-11-06 22:41:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:22,895 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-11-06 22:41:22,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-11-06 22:41:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:41:22,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:22,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:22,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:41:22,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:22,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 872562296, now seen corresponding path program 1 times [2023-11-06 22:41:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151358833] [2023-11-06 22:41:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151358833] [2023-11-06 22:41:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151358833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:41:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347871650] [2023-11-06 22:41:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:23,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:23,094 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:23,340 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2023-11-06 22:41:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 14 [2023-11-06 22:41:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:23,343 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:41:23,343 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:41:23,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:41:23,346 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 215 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:23,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 399 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:41:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2023-11-06 22:41:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 93 states have internal predecessors, (108), 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-06 22:41:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2023-11-06 22:41:23,354 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 14 [2023-11-06 22:41:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:23,354 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2023-11-06 22:41:23,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2023-11-06 22:41:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:41:23,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:23,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:41:23,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:23,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1034559989, now seen corresponding path program 1 times [2023-11-06 22:41:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648417000] [2023-11-06 22:41:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648417000] [2023-11-06 22:41:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648417000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:41:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960503816] [2023-11-06 22:41:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:41:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:41:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:23,769 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:24,171 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2023-11-06 22:41:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:41:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:24,173 INFO L225 Difference]: With dead ends: 141 [2023-11-06 22:41:24,173 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 22:41:24,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:41:24,174 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 289 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:24,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 346 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 22:41:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 95. [2023-11-06 22:41:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 93 states have internal predecessors, (107), 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-06 22:41:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2023-11-06 22:41:24,178 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 16 [2023-11-06 22:41:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:24,178 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2023-11-06 22:41:24,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2023-11-06 22:41:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:41:24,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:24,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:41:24,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:24,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1034559990, now seen corresponding path program 1 times [2023-11-06 22:41:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552275052] [2023-11-06 22:41:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552275052] [2023-11-06 22:41:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552275052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842689238] [2023-11-06 22:41:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:24,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:24,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:24,649 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:25,044 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2023-11-06 22:41:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:41:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:41:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:25,046 INFO L225 Difference]: With dead ends: 151 [2023-11-06 22:41:25,046 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:41:25,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:41:25,047 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 205 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:25,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 259 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:41:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:41:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2023-11-06 22:41:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.452054794520548) internal successors, (106), 93 states have internal predecessors, (106), 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-06 22:41:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2023-11-06 22:41:25,051 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 16 [2023-11-06 22:41:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:25,051 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2023-11-06 22:41:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2023-11-06 22:41:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 22:41:25,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:25,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:25,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:41:25,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:25,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2006573790, now seen corresponding path program 1 times [2023-11-06 22:41:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816993037] [2023-11-06 22:41:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816993037] [2023-11-06 22:41:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816993037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742370386] [2023-11-06 22:41:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:25,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:25,378 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:25,705 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2023-11-06 22:41:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2023-11-06 22:41:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:25,707 INFO L225 Difference]: With dead ends: 152 [2023-11-06 22:41:25,708 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 22:41:25,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:25,709 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 172 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:25,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 224 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 22:41:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2023-11-06 22:41:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 115 states have internal predecessors, (143), 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-06 22:41:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2023-11-06 22:41:25,714 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 17 [2023-11-06 22:41:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:25,714 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2023-11-06 22:41:25,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2023-11-06 22:41:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 22:41:25,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:25,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:25,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:41:25,716 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:25,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2006573789, now seen corresponding path program 1 times [2023-11-06 22:41:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774696669] [2023-11-06 22:41:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:25,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:25,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774696669] [2023-11-06 22:41:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774696669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737954842] [2023-11-06 22:41:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:25,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:25,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:25,913 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:26,183 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2023-11-06 22:41:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2023-11-06 22:41:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:26,186 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:41:26,186 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:41:26,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:41:26,187 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 265 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:26,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 217 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:41:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2023-11-06 22:41:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 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-06 22:41:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2023-11-06 22:41:26,191 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 17 [2023-11-06 22:41:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:26,192 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2023-11-06 22:41:26,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2023-11-06 22:41:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 22:41:26,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:26,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:41:26,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:26,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1001820792, now seen corresponding path program 1 times [2023-11-06 22:41:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098115850] [2023-11-06 22:41:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098115850] [2023-11-06 22:41:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098115850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:41:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120060207] [2023-11-06 22:41:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:26,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:26,294 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:26,425 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2023-11-06 22:41:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 19 [2023-11-06 22:41:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:26,427 INFO L225 Difference]: With dead ends: 120 [2023-11-06 22:41:26,427 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:41:26,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:26,428 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 17 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:26,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 317 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:41:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2023-11-06 22:41:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2023-11-06 22:41:26,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 19 [2023-11-06 22:41:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:26,434 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2023-11-06 22:41:26,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2023-11-06 22:41:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:41:26,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:26,436 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] [2023-11-06 22:41:26,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:41:26,436 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:26,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash 485070872, now seen corresponding path program 1 times [2023-11-06 22:41:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527925078] [2023-11-06 22:41:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:26,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527925078] [2023-11-06 22:41:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527925078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:26,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125788047] [2023-11-06 22:41:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:41:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:41:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:41:26,683 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-06 22:41:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:26,975 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2023-11-06 22:41:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:41:26,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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 20 [2023-11-06 22:41:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:26,981 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:41:26,982 INFO L226 Difference]: Without dead ends: 146 [2023-11-06 22:41:26,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:26,983 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 122 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:26,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 343 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-06 22:41:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2023-11-06 22:41:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2023-11-06 22:41:26,987 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 20 [2023-11-06 22:41:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:26,988 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2023-11-06 22:41:26,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-06 22:41:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2023-11-06 22:41:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:41:26,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:26,989 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-06 22:41:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:41:26,990 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:26,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1273252784, now seen corresponding path program 1 times [2023-11-06 22:41:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:26,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030281681] [2023-11-06 22:41:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030281681] [2023-11-06 22:41:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030281681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:27,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:41:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770922615] [2023-11-06 22:41:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:27,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:27,058 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:27,187 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2023-11-06 22:41:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:41:27,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 22:41:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:27,189 INFO L225 Difference]: With dead ends: 119 [2023-11-06 22:41:27,189 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 22:41:27,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:27,190 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:27,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 164 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 22:41:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2023-11-06 22:41:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 114 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2023-11-06 22:41:27,195 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 21 [2023-11-06 22:41:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:27,195 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2023-11-06 22:41:27,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2023-11-06 22:41:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:41:27,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:27,196 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-06 22:41:27,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:41:27,196 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:27,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1273252783, now seen corresponding path program 1 times [2023-11-06 22:41:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89989110] [2023-11-06 22:41:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89989110] [2023-11-06 22:41:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89989110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:27,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:27,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:41:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73892103] [2023-11-06 22:41:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:27,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:41:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:41:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:27,616 INFO L87 Difference]: Start difference. First operand 116 states and 141 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-06 22:41:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:28,047 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2023-11-06 22:41:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:28,048 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-06 22:41:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:28,049 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:41:28,049 INFO L226 Difference]: Without dead ends: 146 [2023-11-06 22:41:28,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:41:28,050 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 183 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:28,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 277 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:41:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-06 22:41:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2023-11-06 22:41:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4375) internal successors, (138), 114 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2023-11-06 22:41:28,054 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 21 [2023-11-06 22:41:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:28,054 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2023-11-06 22:41:28,055 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-06 22:41:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2023-11-06 22:41:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:28,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:28,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:28,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:41:28,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:28,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash -804533597, now seen corresponding path program 1 times [2023-11-06 22:41:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:28,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116613976] [2023-11-06 22:41:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116613976] [2023-11-06 22:41:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116613976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:41:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614738873] [2023-11-06 22:41:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:28,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:41:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:41:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:28,568 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,073 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-11-06 22:41:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:41:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:41:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:29,075 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:41:29,075 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 22:41:29,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:41:29,076 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 203 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:29,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 510 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:41:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 22:41:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2023-11-06 22:41:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 114 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2023-11-06 22:41:29,080 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 22 [2023-11-06 22:41:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:29,080 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2023-11-06 22:41:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2023-11-06 22:41:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:29,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:29,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:41:29,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:29,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1998319909, now seen corresponding path program 1 times [2023-11-06 22:41:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292974067] [2023-11-06 22:41:29,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292974067] [2023-11-06 22:41:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292974067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:41:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125652209] [2023-11-06 22:41:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:41:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:41:29,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:29,362 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,645 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-11-06 22:41:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:41:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:41:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:29,647 INFO L225 Difference]: With dead ends: 128 [2023-11-06 22:41:29,647 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:41:29,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:41:29,648 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:29,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 338 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:41:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2023-11-06 22:41:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.425531914893617) internal successors, (134), 112 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2023-11-06 22:41:29,652 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 22 [2023-11-06 22:41:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2023-11-06 22:41:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2023-11-06 22:41:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:29,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:29,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:41:29,653 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:29,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1996902851, now seen corresponding path program 1 times [2023-11-06 22:41:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541998175] [2023-11-06 22:41:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541998175] [2023-11-06 22:41:29,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541998175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:41:29,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887083478] [2023-11-06 22:41:29,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:41:29,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:41:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:29,901 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,141 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-11-06 22:41:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:30,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:41:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:30,143 INFO L225 Difference]: With dead ends: 141 [2023-11-06 22:41:30,143 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 22:41:30,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:41:30,144 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 195 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:30,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 299 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 22:41:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2023-11-06 22:41:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 113 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2023-11-06 22:41:30,150 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 22 [2023-11-06 22:41:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:30,150 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2023-11-06 22:41:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2023-11-06 22:41:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:30,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:30,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:41:30,152 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:30,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 161706573, now seen corresponding path program 1 times [2023-11-06 22:41:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778262429] [2023-11-06 22:41:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778262429] [2023-11-06 22:41:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778262429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689746063] [2023-11-06 22:41:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:30,200 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,217 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2023-11-06 22:41:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 22:41:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:30,219 INFO L225 Difference]: With dead ends: 179 [2023-11-06 22:41:30,219 INFO L226 Difference]: Without dead ends: 179 [2023-11-06 22:41:30,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:30,220 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:30,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:41:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-06 22:41:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 128. [2023-11-06 22:41:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 126 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2023-11-06 22:41:30,228 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 22 [2023-11-06 22:41:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:30,228 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2023-11-06 22:41:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2023-11-06 22:41:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:41:30,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:30,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:41:30,230 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:30,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 826748559, now seen corresponding path program 1 times [2023-11-06 22:41:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728683414] [2023-11-06 22:41:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728683414] [2023-11-06 22:41:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728683414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560434450] [2023-11-06 22:41:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:30,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:30,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:41:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:41:30,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:30,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:41:31,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:41:31,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:41:31,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:41:31,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:31,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2023-11-06 22:41:31,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:41:31,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:41:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:31,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560434450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:31,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:31,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 20 [2023-11-06 22:41:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619159445] [2023-11-06 22:41:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:41:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:41:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:41:31,400 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:31,808 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-11-06 22:41:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:41:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 24 [2023-11-06 22:41:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:31,811 INFO L225 Difference]: With dead ends: 148 [2023-11-06 22:41:31,812 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 22:41:31,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:41:31,813 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 169 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:31,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 421 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 22:41:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2023-11-06 22:41:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 126 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2023-11-06 22:41:31,818 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 24 [2023-11-06 22:41:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:31,819 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2023-11-06 22:41:31,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2023-11-06 22:41:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:41:31,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:31,820 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] [2023-11-06 22:41:31,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:41:32,026 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-06 22:41:32,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1541271261, now seen corresponding path program 1 times [2023-11-06 22:41:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794056382] [2023-11-06 22:41:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:32,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:32,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:32,094 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:41:32,095 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (43 of 44 remaining) [2023-11-06 22:41:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 44 remaining) [2023-11-06 22:41:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 44 remaining) [2023-11-06 22:41:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 44 remaining) [2023-11-06 22:41:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 44 remaining) [2023-11-06 22:41:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 44 remaining) [2023-11-06 22:41:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 44 remaining) [2023-11-06 22:41:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 44 remaining) [2023-11-06 22:41:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 44 remaining) [2023-11-06 22:41:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 44 remaining) [2023-11-06 22:41:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 44 remaining) [2023-11-06 22:41:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 44 remaining) [2023-11-06 22:41:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 44 remaining) [2023-11-06 22:41:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 44 remaining) [2023-11-06 22:41:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 44 remaining) [2023-11-06 22:41:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 44 remaining) [2023-11-06 22:41:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 44 remaining) [2023-11-06 22:41:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 44 remaining) [2023-11-06 22:41:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 44 remaining) [2023-11-06 22:41:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 44 remaining) [2023-11-06 22:41:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 44 remaining) [2023-11-06 22:41:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 44 remaining) [2023-11-06 22:41:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 44 remaining) [2023-11-06 22:41:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 44 remaining) [2023-11-06 22:41:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 44 remaining) [2023-11-06 22:41:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 44 remaining) [2023-11-06 22:41:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 44 remaining) [2023-11-06 22:41:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 44 remaining) [2023-11-06 22:41:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 44 remaining) [2023-11-06 22:41:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 44 remaining) [2023-11-06 22:41:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 44 remaining) [2023-11-06 22:41:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 44 remaining) [2023-11-06 22:41:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 44 remaining) [2023-11-06 22:41:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 44 remaining) [2023-11-06 22:41:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 44 remaining) [2023-11-06 22:41:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 44 remaining) [2023-11-06 22:41:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 44 remaining) [2023-11-06 22:41:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (6 of 44 remaining) [2023-11-06 22:41:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (5 of 44 remaining) [2023-11-06 22:41:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (4 of 44 remaining) [2023-11-06 22:41:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (3 of 44 remaining) [2023-11-06 22:41:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (2 of 44 remaining) [2023-11-06 22:41:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (1 of 44 remaining) [2023-11-06 22:41:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK (0 of 44 remaining) [2023-11-06 22:41:32,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:41:32,113 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:32,118 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:41:32,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:41:32 BoogieIcfgContainer [2023-11-06 22:41:32,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:41:32,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:41:32,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:41:32,165 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:41:32,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:18" (3/4) ... [2023-11-06 22:41:32,167 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:41:32,229 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:41:32,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:41:32,230 INFO L158 Benchmark]: Toolchain (without parser) took 14739.48ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 94.0MB in the beginning and 119.7MB in the end (delta: -25.7MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,230 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:32,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.91ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 76.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.17ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,235 INFO L158 Benchmark]: Boogie Preprocessor took 33.66ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,236 INFO L158 Benchmark]: RCFGBuilder took 626.43ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 107.4MB in the end (delta: -34.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,238 INFO L158 Benchmark]: TraceAbstraction took 13448.95ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 106.4MB in the beginning and 121.8MB in the end (delta: -15.3MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,239 INFO L158 Benchmark]: Witness Printer took 64.23ms. Allocated memory is still 249.6MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:32,246 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.91ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 76.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.17ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.66ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 626.43ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 107.4MB in the end (delta: -34.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13448.95ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 106.4MB in the beginning and 121.8MB in the end (delta: -15.3MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 64.23ms. Allocated memory is still 249.6MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 VAL [head={-1:0}] [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next VAL [head->next={-1:0}, head={-1:0}, state=1, x={-1:0}] [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x->data=1, x={-1:0}] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x->next->data=1, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x->next->data != 0 && x->data > x->next->data=1, x->next->data=1, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x->data=1, x->next->data != 0 && x->data > x->next->data=1, x->next->data=1, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x->data=1, x->next->data != 0 && x->data > x->next->data=1, x->next->data=1, x->next={-1:0}, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x->data=1, x->next->data != 0 && x->data > x->next->data=1, x->next->data=1, x->next->data=1, x->next={-1:0}, x->next={-1:0}, x={-1:0}] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x->data=1, x->next->data != 0 && x->data > x->next->data=0, x->next->data=1, x->next->data=1, x->next={-1:0}, x->next={-1:0}, x={-1:0}] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-circular-2.c", 14, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3153 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3153 mSDsluCounter, 5486 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4089 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4221 IncrementalHoareTripleChecker+Invalid, 4372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 1397 mSDtfsCounter, 4221 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=21, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 556 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 3794 SizeOfPredicates, 11 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:41:32,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c62a979-2e4b-43f9-8420-2e973bda8480/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)