./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.c -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 61af92b34b08b0476c248a095e1eb0914aca71353157c9c4012a89fb151ac4ec --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:08,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:09,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:58:09,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:09,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:09,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:09,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:09,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:09,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:09,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:09,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:09,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:09,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:09,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:09,038 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:09,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:09,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:09,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:09,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:09,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:09,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:09,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:09,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:09,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:09,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:09,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:09,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 61af92b34b08b0476c248a095e1eb0914aca71353157c9c4012a89fb151ac4ec [2025-04-29 10:58:09,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:09,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:09,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:09,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:09,396 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:09,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hh2012-ex3.c [2025-04-29 10:58:10,622 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca697f6d/554e1b5e39434fbfaf8c29aede095a2a/FLAGfab67e85b [2025-04-29 10:58:10,806 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:10,807 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.c [2025-04-29 10:58:10,808 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:10,819 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca697f6d/554e1b5e39434fbfaf8c29aede095a2a/FLAGfab67e85b [2025-04-29 10:58:11,673 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca697f6d/554e1b5e39434fbfaf8c29aede095a2a [2025-04-29 10:58:11,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:11,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:11,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:11,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:11,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:11,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77220025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11, skipping insertion in model container [2025-04-29 10:58:11,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:11,804 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.c[243,256] [2025-04-29 10:58:11,815 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:11,818 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:11,834 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex3.c[243,256] [2025-04-29 10:58:11,841 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:11,850 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:11,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11 WrapperNode [2025-04-29 10:58:11,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:11,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:11,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:11,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:11,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,871 INFO L138 Inliner]: procedures = 6, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-04-29 10:58:11,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:11,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:11,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:11,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:11,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,887 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:58:11,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:11,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:11,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:11,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:11,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:11,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:11,927 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) [2025-04-29 10:58:11,934 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 [2025-04-29 10:58:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 10:58:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 10:58:11,987 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:11,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:12,076 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-04-29 10:58:12,076 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:12,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:12,084 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:58:12,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:12 BoogieIcfgContainer [2025-04-29 10:58:12,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:12,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:12,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:12,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:12,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:11" (1/3) ... [2025-04-29 10:58:12,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:12, skipping insertion in model container [2025-04-29 10:58:12,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (2/3) ... [2025-04-29 10:58:12,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:12, skipping insertion in model container [2025-04-29 10:58:12,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:12" (3/3) ... [2025-04-29 10:58:12,094 INFO L128 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.c [2025-04-29 10:58:12,104 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:12,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hh2012-ex3.c that has 2 procedures, 22 locations, 39 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:58:12,151 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:12,161 INFO L340 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;@54edf365, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:12,161 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:58:12,164 INFO L278 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:12,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 10:58:12,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,170 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 155501436, now seen corresponding path program 1 times [2025-04-29 10:58:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233845051] [2025-04-29 10:58:12,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 10:58:12,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 10:58:12,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233845051] [2025-04-29 10:58:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233845051] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821618012] [2025-04-29 10:58:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:12,306 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,345 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2025-04-29 10:58:12,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:12,347 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 10:58:12,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,351 INFO L225 Difference]: With dead ends: 43 [2025-04-29 10:58:12,352 INFO L226 Difference]: Without dead ends: 20 [2025-04-29 10:58:12,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:12,357 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-29 10:58:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-04-29 10:58:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-04-29 10:58:12,379 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2025-04-29 10:58:12,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,379 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-04-29 10:58:12,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:12,380 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-04-29 10:58:12,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 10:58:12,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:12,380 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 149721982, now seen corresponding path program 1 times [2025-04-29 10:58:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733506511] [2025-04-29 10:58:12,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 10:58:12,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 10:58:12,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733506511] [2025-04-29 10:58:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733506511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191052534] [2025-04-29 10:58:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:12,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:12,475 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,541 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-04-29 10:58:12,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:12,542 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 10:58:12,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,542 INFO L225 Difference]: With dead ends: 26 [2025-04-29 10:58:12,542 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 10:58:12,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:12,543 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 10:58:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-29 10:58:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-04-29 10:58:12,549 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2025-04-29 10:58:12,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,549 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-04-29 10:58:12,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:12,549 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-04-29 10:58:12,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 10:58:12,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,549 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:58:12,550 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1832483646, now seen corresponding path program 1 times [2025-04-29 10:58:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767158826] [2025-04-29 10:58:12,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:58:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:58:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767158826] [2025-04-29 10:58:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767158826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:12,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846275005] [2025-04-29 10:58:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:12,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:12,649 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,734 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-04-29 10:58:12,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:12,736 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-29 10:58:12,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,737 INFO L225 Difference]: With dead ends: 30 [2025-04-29 10:58:12,737 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:58:12,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:58:12,738 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:58:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:58:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:58:12,750 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2025-04-29 10:58:12,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,750 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:58:12,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:12,750 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:58:12,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 10:58:12,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,751 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:58:12,751 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1336181566, now seen corresponding path program 1 times [2025-04-29 10:58:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847240576] [2025-04-29 10:58:12,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:58:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:58:12,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:58:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847240576] [2025-04-29 10:58:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847240576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903134564] [2025-04-29 10:58:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:12,869 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:58:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,949 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-04-29 10:58:12,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:58:12,950 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-04-29 10:58:12,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,951 INFO L225 Difference]: With dead ends: 46 [2025-04-29 10:58:12,952 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 10:58:12,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:58:12,953 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 10:58:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-04-29 10:58:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-29 10:58:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-04-29 10:58:12,970 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2025-04-29 10:58:12,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,970 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-04-29 10:58:12,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:58:12,971 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-04-29 10:58:12,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:58:12,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,971 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:58:12,972 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -553938178, now seen corresponding path program 1 times [2025-04-29 10:58:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783374370] [2025-04-29 10:58:12,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:58:12,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:58:12,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:58:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:13,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783374370] [2025-04-29 10:58:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783374370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:13,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783990949] [2025-04-29 10:58:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:13,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:13,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:13,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:13,057 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:58:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:13,112 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-04-29 10:58:13,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:13,115 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-04-29 10:58:13,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:13,117 INFO L225 Difference]: With dead ends: 89 [2025-04-29 10:58:13,117 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 10:58:13,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:13,118 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:13,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 10:58:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 10:58:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-04-29 10:58:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-04-29 10:58:13,127 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2025-04-29 10:58:13,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:13,127 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-04-29 10:58:13,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:58:13,127 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-04-29 10:58:13,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 10:58:13,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:13,128 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:13,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:58:13,128 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:13,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1842573482, now seen corresponding path program 1 times [2025-04-29 10:58:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:13,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814675608] [2025-04-29 10:58:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 10:58:13,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 10:58:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-29 10:58:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:13,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814675608] [2025-04-29 10:58:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814675608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:58:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629213673] [2025-04-29 10:58:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:13,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:58:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:58:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:13,202 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-29 10:58:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:13,242 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-04-29 10:58:13,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:58:13,243 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2025-04-29 10:58:13,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:13,243 INFO L225 Difference]: With dead ends: 62 [2025-04-29 10:58:13,243 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 10:58:13,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:13,244 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:13,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 10:58:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-29 10:58:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-04-29 10:58:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-04-29 10:58:13,253 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2025-04-29 10:58:13,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:13,253 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-04-29 10:58:13,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-29 10:58:13,253 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-04-29 10:58:13,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-04-29 10:58:13,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:13,254 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:13,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:58:13,255 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:13,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -489439653, now seen corresponding path program 1 times [2025-04-29 10:58:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:13,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562107375] [2025-04-29 10:58:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:13,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-29 10:58:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-29 10:58:13,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-04-29 10:58:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:13,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562107375] [2025-04-29 10:58:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562107375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:13,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736337066] [2025-04-29 10:58:13,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:13,375 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) [2025-04-29 10:58:13,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:58:13,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-29 10:58:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-29 10:58:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:13,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:58:13,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 218 proven. 7 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-04-29 10:58:13,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-04-29 10:58:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736337066] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:13,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-29 10:58:13,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096024893] [2025-04-29 10:58:13,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:13,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:13,567 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-04-29 10:58:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:13,616 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2025-04-29 10:58:13,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:13,617 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 83 [2025-04-29 10:58:13,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:13,620 INFO L225 Difference]: With dead ends: 126 [2025-04-29 10:58:13,621 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 10:58:13,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:13,622 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:13,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 10:58:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-29 10:58:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-04-29 10:58:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-04-29 10:58:13,637 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 83 [2025-04-29 10:58:13,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:13,637 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-04-29 10:58:13,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-04-29 10:58:13,637 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-04-29 10:58:13,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-04-29 10:58:13,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:13,638 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:13,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:13,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:13,839 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:13,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash -375717413, now seen corresponding path program 2 times [2025-04-29 10:58:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:13,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895573449] [2025-04-29 10:58:13,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:13,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-04-29 10:58:13,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-04-29 10:58:13,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:13,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-04-29 10:58:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:14,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895573449] [2025-04-29 10:58:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895573449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:14,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482553942] [2025-04-29 10:58:14,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:14,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:14,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:14,101 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) [2025-04-29 10:58:14,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:58:14,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-04-29 10:58:14,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-04-29 10:58:14,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:14,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:14,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 10:58:14,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-04-29 10:58:14,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 44 proven. 18 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-04-29 10:58:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482553942] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:14,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 8] total 23 [2025-04-29 10:58:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089207632] [2025-04-29 10:58:14,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:14,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:58:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:14,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:58:14,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:58:14,582 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 13 states have call successors, (57), 3 states have call predecessors, (57), 1 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2025-04-29 10:58:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:14,914 INFO L93 Difference]: Finished difference Result 200 states and 301 transitions. [2025-04-29 10:58:14,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 10:58:14,914 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 13 states have call successors, (57), 3 states have call predecessors, (57), 1 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) Word has length 125 [2025-04-29 10:58:14,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:14,915 INFO L225 Difference]: With dead ends: 200 [2025-04-29 10:58:14,915 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:58:14,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2025-04-29 10:58:14,917 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:14,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 234 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:58:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:58:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:58:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:58:14,918 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2025-04-29 10:58:14,918 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:14,918 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:58:14,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 13 states have call successors, (57), 3 states have call predecessors, (57), 1 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2025-04-29 10:58:14,919 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:58:14,919 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:58:14,921 INFO L790 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:58:14,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:15,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-29 10:58:15,124 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:15,125 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:58:15,666 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:58:15,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:58:15 BoogieIcfgContainer [2025-04-29 10:58:15,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:58:15,681 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:58:15,681 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:58:15,681 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:58:15,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:12" (3/4) ... [2025-04-29 10:58:15,685 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:58:15,689 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-29 10:58:15,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 10:58:15,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:58:15,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:58:15,753 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:58:15,753 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:58:15,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:58:15,754 INFO L158 Benchmark]: Toolchain (without parser) took 4078.34ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 113.5MB in the beginning and 219.3MB in the end (delta: -105.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-04-29 10:58:15,754 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:15,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.71ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 100.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:58:15,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.35ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:15,756 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:15,756 INFO L158 Benchmark]: RCFGBuilder took 186.89ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 87.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:15,756 INFO L158 Benchmark]: TraceAbstraction took 3593.24ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 87.4MB in the beginning and 224.7MB in the end (delta: -137.3MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-04-29 10:58:15,757 INFO L158 Benchmark]: Witness Printer took 72.73ms. Allocated memory is still 293.6MB. Free memory was 224.7MB in the beginning and 219.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:15,758 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.71ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 100.7MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.35ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 186.89ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 87.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3593.24ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 87.4MB in the beginning and 224.7MB in the end (delta: -137.3MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 72.73ms. Allocated memory is still 293.6MB. Free memory was 224.7MB in the beginning and 219.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 7]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 39 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 201 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 413 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 1260 SizeOfPredicates, 1 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 4279/4418 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((i <= 4) && (0 <= i)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((i <= 3) && (0 <= i)) && (j == 0)) || ((((j <= 4) && (1 <= j)) && (i <= ((long long) 3 + j))) && (j <= i))) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:58:15,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE