./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 528fbc32d9aa1d8a4eedfd9ab07830e3af97eea6ef37fe4df10e8aa3c9d21936 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:39:19,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:39:19,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:39:19,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:39:19,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:39:19,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:39:19,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:39:19,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:39:19,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:39:19,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:39:19,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:39:19,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:39:19,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:39:19,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:39:19,360 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:39:19,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:39:19,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:39:19,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:39:19,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:39:19,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:39:19,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:39:19,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:39:19,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:39:19,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:39:19,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:39:19,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:39:19,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:39:19,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:39:19,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:39:19,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:39:19,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:39:19,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:39:19,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:39:19,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:39:19,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:39:19,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:39:19,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:39:19,369 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 528fbc32d9aa1d8a4eedfd9ab07830e3af97eea6ef37fe4df10e8aa3c9d21936 [2024-11-16 06:39:19,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:39:19,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:39:19,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:39:19,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:39:19,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:39:19,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2024-11-16 06:39:20,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:39:21,168 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:39:21,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2024-11-16 06:39:21,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1e9602/4dd504091c79472a93e93a293b156dda/FLAG3f781d348 [2024-11-16 06:39:21,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1e9602/4dd504091c79472a93e93a293b156dda [2024-11-16 06:39:21,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:39:21,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:39:21,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:39:21,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:39:21,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:39:21,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7545fe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21, skipping insertion in model container [2024-11-16 06:39:21,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:39:21,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i[23818,23831] [2024-11-16 06:39:21,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:39:21,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:39:21,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i[23818,23831] [2024-11-16 06:39:21,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:39:21,676 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:39:21,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21 WrapperNode [2024-11-16 06:39:21,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:39:21,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:39:21,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:39:21,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:39:21,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,715 INFO L138 Inliner]: procedures = 125, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 85 [2024-11-16 06:39:21,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:39:21,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:39:21,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:39:21,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:39:21,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,742 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 06:39:21,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:39:21,750 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:39:21,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:39:21,750 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:39:21,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (1/1) ... [2024-11-16 06:39:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:39:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:21,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 06:39:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 06:39:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:39:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:39:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:39:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:39:21,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:39:21,896 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:39:21,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:39:21,991 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-16 06:39:22,000 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-16 06:39:22,001 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:39:22,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:39:22,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:39:22,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:39:22 BoogieIcfgContainer [2024-11-16 06:39:22,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:39:22,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:39:22,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:39:22,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:39:22,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:39:21" (1/3) ... [2024-11-16 06:39:22,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9dda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:39:22, skipping insertion in model container [2024-11-16 06:39:22,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:21" (2/3) ... [2024-11-16 06:39:22,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9dda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:39:22, skipping insertion in model container [2024-11-16 06:39:22,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:39:22" (3/3) ... [2024-11-16 06:39:22,017 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2024-11-16 06:39:22,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:39:22,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:39:22,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:39:22,075 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6d46c497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:39:22,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:39:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 06:39:22,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:22,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:22,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:22,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -49745978, now seen corresponding path program 1 times [2024-11-16 06:39:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047516156] [2024-11-16 06:39:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047516156] [2024-11-16 06:39:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047516156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:39:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:39:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524042785] [2024-11-16 06:39:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:22,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:39:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:39:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:39:22,227 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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) [2024-11-16 06:39:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:22,239 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-11-16 06:39:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:39:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 [2024-11-16 06:39:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:22,247 INFO L225 Difference]: With dead ends: 50 [2024-11-16 06:39:22,247 INFO L226 Difference]: Without dead ends: 20 [2024-11-16 06:39:22,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:39:22,253 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:22,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-16 06:39:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-16 06:39:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-16 06:39:22,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2024-11-16 06:39:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:22,278 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-16 06:39:22,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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) [2024-11-16 06:39:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-16 06:39:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 06:39:22,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:22,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:39:22,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -944963075, now seen corresponding path program 1 times [2024-11-16 06:39:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047273637] [2024-11-16 06:39:22,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047273637] [2024-11-16 06:39:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047273637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:22,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:39:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:39:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415821675] [2024-11-16 06:39:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:22,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:39:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:39:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:39:22,543 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2024-11-16 06:39:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:22,566 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-16 06:39:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:39:22,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 [2024-11-16 06:39:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:22,568 INFO L225 Difference]: With dead ends: 49 [2024-11-16 06:39:22,568 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 06:39:22,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:39:22,569 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:22,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 06:39:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2024-11-16 06:39:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-16 06:39:22,576 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-16 06:39:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:22,577 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-16 06:39:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2024-11-16 06:39:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-16 06:39:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 06:39:22,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:22,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:39:22,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash 874828012, now seen corresponding path program 1 times [2024-11-16 06:39:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501788671] [2024-11-16 06:39:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501788671] [2024-11-16 06:39:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501788671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930640430] [2024-11-16 06:39:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:22,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:22,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:22,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:39:22,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 06:39:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:22,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:39:22,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:22,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:39:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930640430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 06:39:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-16 06:39:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312946316] [2024-11-16 06:39:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:39:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:39:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:39:22,754 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2024-11-16 06:39:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:22,788 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-16 06:39:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:39:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 [2024-11-16 06:39:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:22,789 INFO L225 Difference]: With dead ends: 51 [2024-11-16 06:39:22,789 INFO L226 Difference]: Without dead ends: 41 [2024-11-16 06:39:22,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:39:22,791 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:22,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-16 06:39:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2024-11-16 06:39:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-16 06:39:22,794 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2024-11-16 06:39:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:22,795 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-16 06:39:22,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2024-11-16 06:39:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-16 06:39:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 06:39:22,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:22,795 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:22,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:39:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:23,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:23,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -825690653, now seen corresponding path program 1 times [2024-11-16 06:39:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984522004] [2024-11-16 06:39:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984522004] [2024-11-16 06:39:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984522004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:39:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 06:39:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197725933] [2024-11-16 06:39:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:39:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:39:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:39:23,113 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:23,144 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-16 06:39:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:39:23,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-16 06:39:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:23,146 INFO L225 Difference]: With dead ends: 32 [2024-11-16 06:39:23,146 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 06:39:23,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:39:23,147 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:23,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 06:39:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-16 06:39:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-16 06:39:23,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2024-11-16 06:39:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:23,156 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-16 06:39:23,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-16 06:39:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 06:39:23,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:23,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 06:39:23,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 532999684, now seen corresponding path program 1 times [2024-11-16 06:39:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:23,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402972647] [2024-11-16 06:39:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:23,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402972647] [2024-11-16 06:39:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402972647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447207842] [2024-11-16 06:39:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:23,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:23,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:39:23,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 06:39:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:23,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:39:23,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:23,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447207842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:39:23,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:39:23,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 06:39:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182812051] [2024-11-16 06:39:23,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:39:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 06:39:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:23,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 06:39:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-16 06:39:23,401 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:23,476 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2024-11-16 06:39:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:39:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-16 06:39:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:23,479 INFO L225 Difference]: With dead ends: 71 [2024-11-16 06:39:23,479 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 06:39:23,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:39:23,480 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:23,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 112 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 06:39:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2024-11-16 06:39:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-16 06:39:23,486 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 23 [2024-11-16 06:39:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-16 06:39:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-16 06:39:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 06:39:23,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:23,488 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:23,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 06:39:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:23,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash 876128720, now seen corresponding path program 2 times [2024-11-16 06:39:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:23,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756001468] [2024-11-16 06:39:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756001468] [2024-11-16 06:39:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756001468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893776424] [2024-11-16 06:39:23,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:39:23,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:23,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:23,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:39:23,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 06:39:23,932 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:39:23,932 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:39:23,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 06:39:23,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:23,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 06:39:24,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-16 06:39:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:24,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893776424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:39:24,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:39:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2024-11-16 06:39:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24352434] [2024-11-16 06:39:24,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:39:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 06:39:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 06:39:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:39:24,087 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:24,166 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-16 06:39:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:39:24,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-16 06:39:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:24,167 INFO L225 Difference]: With dead ends: 40 [2024-11-16 06:39:24,168 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 06:39:24,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-16 06:39:24,169 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:24,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 201 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:39:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 06:39:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-16 06:39:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-16 06:39:24,176 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2024-11-16 06:39:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-16 06:39:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-16 06:39:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 06:39:24,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:24,178 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:24,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:39:24,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:24,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -401122639, now seen corresponding path program 3 times [2024-11-16 06:39:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081119849] [2024-11-16 06:39:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:24,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 06:39:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081119849] [2024-11-16 06:39:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081119849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308903355] [2024-11-16 06:39:24,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:39:24,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:24,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:24,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:39:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 06:39:24,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-16 06:39:24,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:39:24,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 06:39:24,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 06:39:24,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 06:39:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308903355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:39:24,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:39:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-16 06:39:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265589344] [2024-11-16 06:39:24,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:39:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:39:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:39:24,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:39:24,704 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:24,761 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2024-11-16 06:39:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:39:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-16 06:39:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:24,762 INFO L225 Difference]: With dead ends: 71 [2024-11-16 06:39:24,762 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 06:39:24,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:39:24,763 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:24,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 142 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 06:39:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-11-16 06:39:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-16 06:39:24,770 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 33 [2024-11-16 06:39:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:24,771 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-16 06:39:24,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:39:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-16 06:39:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 06:39:24,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:24,772 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:24,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:39:24,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:24,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 520968018, now seen corresponding path program 4 times [2024-11-16 06:39:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182364750] [2024-11-16 06:39:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:39:24,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:39:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:39:25,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:39:25,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:39:25,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:39:25,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 06:39:25,040 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-16 06:39:25,064 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:39:25,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:39:25 BoogieIcfgContainer [2024-11-16 06:39:25,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:39:25,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:39:25,067 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:39:25,067 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:39:25,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:39:22" (3/4) ... [2024-11-16 06:39:25,068 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:39:25,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:39:25,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:39:25,114 INFO L158 Benchmark]: Toolchain (without parser) took 3885.07ms. Allocated memory was 211.8MB in the beginning and 304.1MB in the end (delta: 92.3MB). Free memory was 182.5MB in the beginning and 249.3MB in the end (delta: -66.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,114 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:39:25,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.36ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 166.7MB in the end (delta: 15.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.40ms. Allocated memory is still 211.8MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,115 INFO L158 Benchmark]: Boogie Preprocessor took 32.37ms. Allocated memory is still 211.8MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,115 INFO L158 Benchmark]: IcfgBuilder took 260.07ms. Allocated memory is still 211.8MB. Free memory was 162.5MB in the beginning and 148.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,115 INFO L158 Benchmark]: TraceAbstraction took 3054.43ms. Allocated memory was 211.8MB in the beginning and 304.1MB in the end (delta: 92.3MB). Free memory was 146.9MB in the beginning and 252.4MB in the end (delta: -105.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:39:25,116 INFO L158 Benchmark]: Witness Printer took 46.95ms. Allocated memory is still 304.1MB. Free memory was 252.4MB in the beginning and 249.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 06:39:25,117 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.13ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.36ms. Allocated memory is still 211.8MB. Free memory was 182.3MB in the beginning and 166.7MB in the end (delta: 15.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.40ms. Allocated memory is still 211.8MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.37ms. Allocated memory is still 211.8MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 260.07ms. Allocated memory is still 211.8MB. Free memory was 162.5MB in the beginning and 148.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3054.43ms. Allocated memory was 211.8MB in the beginning and 304.1MB in the end (delta: 92.3MB). Free memory was 146.9MB in the beginning and 252.4MB in the end (delta: -105.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 46.95ms. Allocated memory is still 304.1MB. Free memory was 252.4MB in the beginning and 249.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 613]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L603] int len = 2; VAL [len=2] [L604] len < 32 && __VERIFIER_nondet_int() [L604] len < 32 && __VERIFIER_nondet_int() VAL [len=2] [L604] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L607] CALL, EXPR sll_create(len + 1) [L575] SLL head = ((void *)0); VAL [head={0:0}, len=3] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=3, new_head={-1:0}] [L581] new_head->next = head [L582] head = new_head [L583] len-- [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=2, new_head={-2:0}] [L581] new_head->next = head [L582] head = new_head [L583] len-- [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) VAL [head={-2:0}, len=1, new_head={-3:0}] [L581] new_head->next = head [L582] head = new_head [L583] len-- [L576] COND FALSE !(len > 0) VAL [head={-3:0}] [L585] return head; VAL [\result={-3:0}] [L607] RET, EXPR sll_create(len + 1) [L607] SLL s = sll_create(len + 1); [L608] CALL, EXPR sll_length(s) [L588] int len = 0; VAL [head={-3:0}, len=0] [L589] COND TRUE \read(head) [L590] len++ [L591] EXPR head->next [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ [L591] EXPR head->next [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ [L591] EXPR head->next [L591] head = head->next [L589] COND FALSE !(\read(head)) VAL [len=3] [L593] return len; VAL [\result=3] [L608] RET, EXPR sll_length(s) [L608] COND TRUE len != sll_length(s) [L613] reach_error() VAL [s={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 711 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 168 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 986 SizeOfPredicates, 5 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 107/152 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! [2024-11-16 06:39:25,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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