./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 154556615f003714b5a49b3ebe7e74b2231be519e4b6364e10c3e255a1a8cfe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:51:40,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:51:40,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:51:40,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:51:40,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:51:40,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:51:40,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:51:40,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:51:40,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:51:40,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:51:40,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:51:40,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:51:40,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:51:40,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:51:40,558 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:51:40,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:51:40,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:51:40,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:51:40,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:51:40,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:51:40,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:51:40,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:51:40,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:51:40,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:51:40,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:51:40,561 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-jdk21/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 -> 154556615f003714b5a49b3ebe7e74b2231be519e4b6364e10c3e255a1a8cfe1 [2025-02-07 20:51:40,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:51:40,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:51:40,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:51:40,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:51:40,785 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:51:40,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c [2025-02-07 20:51:41,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e54542a6/57c6dba27793444287999127bbec99d7/FLAG3a7ba7079 [2025-02-07 20:51:42,127 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:51:42,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c [2025-02-07 20:51:42,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e54542a6/57c6dba27793444287999127bbec99d7/FLAG3a7ba7079 [2025-02-07 20:51:42,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e54542a6/57c6dba27793444287999127bbec99d7 [2025-02-07 20:51:42,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:51:42,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:51:42,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:51:42,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:51:42,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:51:42,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42, skipping insertion in model container [2025-02-07 20:51:42,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:51:42,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c[524,537] [2025-02-07 20:51:42,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:51:42,294 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:51:42,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c[524,537] [2025-02-07 20:51:42,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:51:42,321 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:51:42,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42 WrapperNode [2025-02-07 20:51:42,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:51:42,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:51:42,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:51:42,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:51:42,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,348 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-02-07 20:51:42,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:51:42,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:51:42,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:51:42,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:51:42,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,366 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:51:42,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:51:42,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:51:42,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:51:42,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:51:42,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (1/1) ... [2025-02-07 20:51:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:51:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:42,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:51:42,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:51:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:51:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:51:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:51:42,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:51:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:51:42,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:51:42,456 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:51:42,457 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:51:42,575 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 20:51:42,575 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:51:42,581 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:51:42,581 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:51:42,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:42 BoogieIcfgContainer [2025-02-07 20:51:42,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:51:42,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:51:42,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:51:42,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:51:42,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:51:42" (1/3) ... [2025-02-07 20:51:42,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb54f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:51:42, skipping insertion in model container [2025-02-07 20:51:42,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:51:42" (2/3) ... [2025-02-07 20:51:42,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb54f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:51:42, skipping insertion in model container [2025-02-07 20:51:42,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:42" (3/3) ... [2025-02-07 20:51:42,588 INFO L128 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound10.c [2025-02-07 20:51:42,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:51:42,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prod4br-ll_unwindbound10.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:51:42,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:51:42,633 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@685f909d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:51:42,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:51:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:51:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:51:42,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:42,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:42,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -378327847, now seen corresponding path program 1 times [2025-02-07 20:51:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419488967] [2025-02-07 20:51:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:42,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:51:42,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:51:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419488967] [2025-02-07 20:51:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419488967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:51:42,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:51:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:51:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292912330] [2025-02-07 20:51:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:51:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:51:42,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:42,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:51:42,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:51:42,767 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-02-07 20:51:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:42,780 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2025-02-07 20:51:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:51:42,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-02-07 20:51:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:42,786 INFO L225 Difference]: With dead ends: 40 [2025-02-07 20:51:42,786 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 20:51:42,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:51:42,792 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:42,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:51:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 20:51:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 20:51:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-02-07 20:51:42,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 8 [2025-02-07 20:51:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:42,816 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-07 20:51:42,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-02-07 20:51:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-02-07 20:51:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:51:42,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:42,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:42,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:51:42,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:42,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1439566617, now seen corresponding path program 1 times [2025-02-07 20:51:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-02-07 20:51:42,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:51:42,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:51:42,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:42,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:51:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407734567] [2025-02-07 20:51:42,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:42,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:42,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:51:42,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:51:42,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:51:42,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:42,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:42,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 20:51:42,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:43,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:51:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009824141] [2025-02-07 20:51:43,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:51:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407734567] [2025-02-07 20:51:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407734567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:51:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:51:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:51:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265821985] [2025-02-07 20:51:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:51:43,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:51:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:43,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:51:43,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:51:43,074 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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-02-07 20:51:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:43,157 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-02-07 20:51:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:51:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2025-02-07 20:51:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:43,158 INFO L225 Difference]: With dead ends: 33 [2025-02-07 20:51:43,158 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 20:51:43,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:51:43,159 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:43,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:51:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 20:51:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-02-07 20:51:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:51:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-07 20:51:43,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 9 [2025-02-07 20:51:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:43,167 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-07 20:51:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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-02-07 20:51:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-02-07 20:51:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:51:43,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:43,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:43,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:51:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:43,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1438702678, now seen corresponding path program 1 times [2025-02-07 20:51:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366549625] [2025-02-07 20:51:43,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:43,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:51:43,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:51:43,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:43,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366549625] [2025-02-07 20:51:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366549625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:51:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:51:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:51:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120367956] [2025-02-07 20:51:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:51:43,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:51:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:43,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:51:43,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:51:43,466 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-07 20:51:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:43,477 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-02-07 20:51:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:51:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-02-07 20:51:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:43,478 INFO L225 Difference]: With dead ends: 33 [2025-02-07 20:51:43,478 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:51:43,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:51:43,479 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:43,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:51:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:51:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 20:51:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:51:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-02-07 20:51:43,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 9 [2025-02-07 20:51:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:43,483 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-02-07 20:51:43,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-07 20:51:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-02-07 20:51:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:51:43,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:43,483 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:43,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:51:43,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash 541850734, now seen corresponding path program 1 times [2025-02-07 20:51:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:43,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325637478] [2025-02-07 20:51:43,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:43,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:51:43,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:51:43,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:51:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088653504] [2025-02-07 20:51:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:43,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:43,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:51:43,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:51:43,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:51:43,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:43,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:43,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-07 20:51:43,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:43,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:51:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325637478] [2025-02-07 20:51:43,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:51:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088653504] [2025-02-07 20:51:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088653504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:51:43,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:51:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-07 20:51:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680439108] [2025-02-07 20:51:43,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:51:43,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:51:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:43,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:51:43,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:51:43,866 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:44,064 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-02-07 20:51:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:51:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-02-07 20:51:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:44,065 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:51:44,065 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:51:44,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:51:44,066 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:44,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 87 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:51:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:51:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2025-02-07 20:51:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:51:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-07 20:51:44,077 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2025-02-07 20:51:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:44,078 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-07 20:51:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-07 20:51:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:51:44,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:44,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:44,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:51:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:44,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1605882822, now seen corresponding path program 1 times [2025-02-07 20:51:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951137354] [2025-02-07 20:51:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:51:44,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:51:44,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:44,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:51:44,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103905643] [2025-02-07 20:51:44,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:44,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:44,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:44,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:44,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:51:44,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:51:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:51:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:44,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:44,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 20:51:44,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:44,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:51:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951137354] [2025-02-07 20:51:45,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:51:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103905643] [2025-02-07 20:51:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103905643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:51:45,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:51:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2025-02-07 20:51:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863024214] [2025-02-07 20:51:45,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:51:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:51:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:51:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:51:45,401 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:45,968 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2025-02-07 20:51:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:51:45,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-07 20:51:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:45,969 INFO L225 Difference]: With dead ends: 60 [2025-02-07 20:51:45,969 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 20:51:45,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:51:45,970 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 98 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:51:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 20:51:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 29. [2025-02-07 20:51:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:51:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-07 20:51:45,980 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2025-02-07 20:51:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:45,980 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-07 20:51:45,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-07 20:51:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:51:45,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:45,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:45,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:51:46,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:46,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1606746761, now seen corresponding path program 1 times [2025-02-07 20:51:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-02-07 20:51:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:46,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:51:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:51:46,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:46,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-02-07 20:51:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941085293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:51:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963547554] [2025-02-07 20:51:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:46,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:46,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:46,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:51:46,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:51:46,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:51:46,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:46,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:46,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:51:46,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:46,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:51:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963547554] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:51:46,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:51:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-07 20:51:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197078276] [2025-02-07 20:51:46,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:51:46,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:51:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:46,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:51:46,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:51:46,381 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:51:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:46,461 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2025-02-07 20:51:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:51:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2025-02-07 20:51:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:46,464 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:51:46,464 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 20:51:46,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:51:46,464 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:46,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 135 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:51:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 20:51:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 70. [2025-02-07 20:51:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 55 states have internal predecessors, (71), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:51:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-02-07 20:51:46,484 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 18 [2025-02-07 20:51:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-02-07 20:51:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:51:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-02-07 20:51:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:51:46,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:46,485 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:46,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:51:46,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-07 20:51:46,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:46,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1425251818, now seen corresponding path program 1 times [2025-02-07 20:51:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-02-07 20:51:46,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:46,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:51:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:51:46,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:51:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758000255] [2025-02-07 20:51:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:51:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:46,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:51:46,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:51:46,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:51:46,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:46,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:46,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:51:46,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:51:46,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:51:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:46,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-02-07 20:51:46,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:51:46,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758000255] [2025-02-07 20:51:46,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758000255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:51:46,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:51:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:51:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100659305] [2025-02-07 20:51:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:51:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:51:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:51:46,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:51:46,760 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:46,804 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2025-02-07 20:51:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:51:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-07 20:51:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:46,805 INFO L225 Difference]: With dead ends: 77 [2025-02-07 20:51:46,805 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 20:51:46,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-02-07 20:51:46,806 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:46,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:51:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 20:51:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-07 20:51:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:51:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-02-07 20:51:46,815 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 20 [2025-02-07 20:51:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:46,815 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-02-07 20:51:46,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:51:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-02-07 20:51:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 20:51:46,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:46,816 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:46,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:51:47,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:47,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1136869014, now seen corresponding path program 2 times [2025-02-07 20:51:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247318228] [2025-02-07 20:51:47,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:51:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:47,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-07 20:51:47,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 20:51:47,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:51:47,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:51:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:51:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247318228] [2025-02-07 20:51:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247318228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:51:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924450854] [2025-02-07 20:51:47,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:51:47,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:47,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:47,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:47,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:51:47,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-07 20:51:47,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 20:51:47,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:51:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:51:47,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:51:47,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:51:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:51:47,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:51:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:51:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924450854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:51:47,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:51:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-07 20:51:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392700144] [2025-02-07 20:51:47,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:51:47,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:51:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:51:47,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:51:47,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:51:47,450 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:51:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:51:47,593 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-02-07 20:51:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:51:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 45 [2025-02-07 20:51:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:51:47,594 INFO L225 Difference]: With dead ends: 131 [2025-02-07 20:51:47,594 INFO L226 Difference]: Without dead ends: 123 [2025-02-07 20:51:47,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:51:47,595 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 128 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:51:47,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 170 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:51:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-07 20:51:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-07 20:51:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 100 states have internal predecessors, (131), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:51:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2025-02-07 20:51:47,614 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 45 [2025-02-07 20:51:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:51:47,614 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2025-02-07 20:51:47,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:51:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2025-02-07 20:51:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 20:51:47,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:51:47,616 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:47,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 20:51:47,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:51:47,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:51:47,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:51:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash 3271178, now seen corresponding path program 3 times [2025-02-07 20:51:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:51:47,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642074325] [2025-02-07 20:51:47,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:51:47,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:51:47,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 11 equivalence classes. [2025-02-07 20:51:47,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:51:47,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:51:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:51:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982419115] [2025-02-07 20:51:47,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:51:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:51:47,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:51:47,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:51:47,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 11 equivalence classes. [2025-02-07 20:51:48,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:51:48,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:51:48,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:51:48,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:51:48,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-07 20:51:48,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:51:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:51:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:51:48,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:51:48,158 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:51:48,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:51:48,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 20:51:48,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:51:48,363 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-02-07 20:51:48,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:51:48,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:51:48 BoogieIcfgContainer [2025-02-07 20:51:48,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:51:48,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:51:48,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:51:48,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:51:48,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:51:42" (3/4) ... [2025-02-07 20:51:48,396 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:51:48,451 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 78. [2025-02-07 20:51:48,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:51:48,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:51:48,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:51:48,523 INFO L158 Benchmark]: Toolchain (without parser) took 6374.97ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 51.9MB in the end (delta: 53.0MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,523 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:51:48,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.87ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.03ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,524 INFO L158 Benchmark]: Boogie Preprocessor took 24.70ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:51:48,524 INFO L158 Benchmark]: IcfgBuilder took 205.69ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 78.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,524 INFO L158 Benchmark]: TraceAbstraction took 5811.69ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 61.3MB in the end (delta: 16.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,524 INFO L158 Benchmark]: Witness Printer took 127.17ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 51.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:51:48,525 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.87ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.03ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.70ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 205.69ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 78.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5811.69ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 61.3MB in the end (delta: 16.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 127.17ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 51.9MB in the end (delta: 9.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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=1024, b=1024, counter=0, p=1, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=512, b=512, counter=1, p=4, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=256, b=256, counter=2, p=16, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=128, b=128, counter=3, p=64, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=64, b=64, counter=4, p=256, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32, b=32, counter=5, p=1024, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=16, counter=6, p=4096, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=8, counter=7, p=16384, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=4, counter=8, p=65536, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=2, counter=9, p=262144, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=1, counter=10, p=1048576, q=0, x=1024, y=1024] [L33] COND TRUE counter++<10 [L33] EXPR counter++ VAL [a=1, b=1, counter=11, p=1048576, q=0, x=1024, y=1024] [L33] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 382 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 708 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 554 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 154 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 170 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=8, InterpolantAutomatonStates: 75, 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, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 287 ConstructedInterpolants, 3 QuantifiedInterpolants, 1309 SizeOfPredicates, 17 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 90/244 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-07 20:51:48,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE