./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_3_6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2ff4855d3411c2183b4955db69fb0d32886e02ca6014c3e616f77788a55bdc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:10:49,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:10:49,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:10:49,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:10:49,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:10:49,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:10:49,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:10:49,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:10:49,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:10:49,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:10:49,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:10:49,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:10:49,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:10:49,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:10:49,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:10:49,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:10:49,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:10:49,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:10:49,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:10:49,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:10:49,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2ff4855d3411c2183b4955db69fb0d32886e02ca6014c3e616f77788a55bdc3 [2025-03-08 07:10:49,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:10:49,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:10:49,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:10:49,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:10:49,606 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:10:49,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_6.i [2025-03-08 07:10:50,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9af1fa01/29fb6cf7b85d486db3c9225e0f65f99c/FLAG90a6e129f [2025-03-08 07:10:51,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:10:51,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i [2025-03-08 07:10:51,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9af1fa01/29fb6cf7b85d486db3c9225e0f65f99c/FLAG90a6e129f [2025-03-08 07:10:51,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9af1fa01/29fb6cf7b85d486db3c9225e0f65f99c [2025-03-08 07:10:51,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:10:51,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:10:51,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:10:51,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:10:51,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:10:51,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a737a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51, skipping insertion in model container [2025-03-08 07:10:51,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:10:51,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[1224,1237] [2025-03-08 07:10:51,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[2848,2861] [2025-03-08 07:10:51,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:10:51,197 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:10:51,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[1224,1237] [2025-03-08 07:10:51,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[2848,2861] [2025-03-08 07:10:51,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:10:51,232 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:10:51,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51 WrapperNode [2025-03-08 07:10:51,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:10:51,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:10:51,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:10:51,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:10:51,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,260 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2025-03-08 07:10:51,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:10:51,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:10:51,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:10:51,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:10:51,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,285 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 07:10:51,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:10:51,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:10:51,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:10:51,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:10:51,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (1/1) ... [2025-03-08 07:10:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:10:51,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:51,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:10:51,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:10:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:10:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-08 07:10:51,345 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-08 07:10:51,345 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 07:10:51,345 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 07:10:51,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:10:51,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 07:10:51,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:10:51,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:10:51,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 07:10:51,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 07:10:51,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:10:51,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:10:51,536 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 07:10:51,536 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:10:51,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:10:51,542 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:10:51,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:51 BoogieIcfgContainer [2025-03-08 07:10:51,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:10:51,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:10:51,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:10:51,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:10:51,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:10:51" (1/3) ... [2025-03-08 07:10:51,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4f09e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:51, skipping insertion in model container [2025-03-08 07:10:51,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:51" (2/3) ... [2025-03-08 07:10:51,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4f09e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:51, skipping insertion in model container [2025-03-08 07:10:51,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:51" (3/3) ... [2025-03-08 07:10:51,550 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_6.i [2025-03-08 07:10:51,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:10:51,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_6.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 07:10:51,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:10:51,610 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;@177aff57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:10:51,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:10:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 07:10:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:10:51,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:51,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:51,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1457985862, now seen corresponding path program 1 times [2025-03-08 07:10:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:51,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619531928] [2025-03-08 07:10:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:10:51,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:10:51,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:51,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619531928] [2025-03-08 07:10:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619531928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:10:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:10:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:10:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846596826] [2025-03-08 07:10:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:10:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:10:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:51,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:10:51,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:51,824 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:10:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:51,861 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2025-03-08 07:10:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:10:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-08 07:10:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:51,867 INFO L225 Difference]: With dead ends: 86 [2025-03-08 07:10:51,867 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 07:10:51,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:51,871 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:51,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:10:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 07:10:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 07:10:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:10:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-08 07:10:51,895 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 11 [2025-03-08 07:10:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:51,895 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-08 07:10:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:10:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-08 07:10:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:10:51,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:51,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:51,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:10:51,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1949477753, now seen corresponding path program 1 times [2025-03-08 07:10:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496059867] [2025-03-08 07:10:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:51,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:10:51,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:10:51,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496059867] [2025-03-08 07:10:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496059867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:10:51,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:10:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:10:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352302598] [2025-03-08 07:10:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:10:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:10:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:51,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:10:51,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:51,967 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:10:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:51,985 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-08 07:10:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:10:51,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-08 07:10:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:51,988 INFO L225 Difference]: With dead ends: 60 [2025-03-08 07:10:51,988 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 07:10:51,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:51,989 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:51,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:10:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 07:10:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-03-08 07:10:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:10:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 07:10:51,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 11 [2025-03-08 07:10:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 07:10:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:10:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 07:10:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 07:10:51,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:52,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:10:52,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2023584397, now seen corresponding path program 1 times [2025-03-08 07:10:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527055227] [2025-03-08 07:10:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:52,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 07:10:52,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 07:10:52,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527055227] [2025-03-08 07:10:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527055227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:10:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:10:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:10:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991707363] [2025-03-08 07:10:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:10:52,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:10:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:52,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:10:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:52,110 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:52,129 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-08 07:10:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:10:52,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 07:10:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:52,130 INFO L225 Difference]: With dead ends: 54 [2025-03-08 07:10:52,130 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 07:10:52,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:52,132 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:52,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:10:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 07:10:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 07:10:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:10:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-08 07:10:52,140 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 14 [2025-03-08 07:10:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:52,142 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-08 07:10:52,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-08 07:10:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 07:10:52,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:52,142 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:52,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:10:52,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:52,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1566506481, now seen corresponding path program 1 times [2025-03-08 07:10:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266415485] [2025-03-08 07:10:52,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 07:10:52,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 07:10:52,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266415485] [2025-03-08 07:10:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266415485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:10:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328442107] [2025-03-08 07:10:52,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:52,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:10:52,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 07:10:52,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 07:10:52,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:52,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:52,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:10:52,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328442107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:52,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:10:52,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-08 07:10:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859649173] [2025-03-08 07:10:52,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:10:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:10:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:10:52,420 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-03-08 07:10:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:52,472 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-08 07:10:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:10:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 07:10:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:52,474 INFO L225 Difference]: With dead ends: 58 [2025-03-08 07:10:52,474 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 07:10:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:10:52,475 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:52,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:10:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 07:10:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 07:10:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:10:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-08 07:10:52,480 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-03-08 07:10:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:52,480 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-08 07:10:52,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-03-08 07:10:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-08 07:10:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 07:10:52,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:52,481 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:52,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:10:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:52,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1328892013, now seen corresponding path program 2 times [2025-03-08 07:10:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744082266] [2025-03-08 07:10:52,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:10:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:52,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 07:10:52,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 07:10:52,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:10:52,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744082266] [2025-03-08 07:10:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744082266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:10:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524097703] [2025-03-08 07:10:52,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:10:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:52,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:10:52,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 07:10:52,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 07:10:52,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:10:52,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:52,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 07:10:52,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:52,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524097703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:53,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:10:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-08 07:10:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850956988] [2025-03-08 07:10:53,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:53,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 07:10:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:53,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 07:10:53,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:10:53,061 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-03-08 07:10:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:53,163 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-03-08 07:10:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:10:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 20 [2025-03-08 07:10:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:53,166 INFO L225 Difference]: With dead ends: 67 [2025-03-08 07:10:53,166 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 07:10:53,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:10:53,166 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:53,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 07:10:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-08 07:10:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:10:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-08 07:10:53,173 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-03-08 07:10:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-08 07:10:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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-03-08 07:10:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-08 07:10:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:10:53,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:53,174 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:53,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:10:53,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:53,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 263410028, now seen corresponding path program 3 times [2025-03-08 07:10:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126301664] [2025-03-08 07:10:53,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 07:10:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:53,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-08 07:10:53,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:10:53,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 07:10:53,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 07:10:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001638856] [2025-03-08 07:10:53,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 07:10:53,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:53,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:53,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:10:53,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-08 07:10:53,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 22 statements. [2025-03-08 07:10:53,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 07:10:53,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:53,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 07:10:53,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:10:53,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:10:53,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126301664] [2025-03-08 07:10:53,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 07:10:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001638856] [2025-03-08 07:10:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001638856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:53,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:10:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-08 07:10:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850071291] [2025-03-08 07:10:53,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 07:10:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:53,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 07:10:53,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 07:10:53,860 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:54,052 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2025-03-08 07:10:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:10:54,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 07:10:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:54,053 INFO L225 Difference]: With dead ends: 72 [2025-03-08 07:10:54,053 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 07:10:54,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:10:54,054 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:54,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 377 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 07:10:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-08 07:10:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 07:10:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-03-08 07:10:54,061 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2025-03-08 07:10:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-03-08 07:10:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-03-08 07:10:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:10:54,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:54,062 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:54,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:10:54,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:54,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1462561109, now seen corresponding path program 4 times [2025-03-08 07:10:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508190294] [2025-03-08 07:10:54,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 07:10:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:54,267 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-08 07:10:54,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:10:54,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 07:10:54,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508190294] [2025-03-08 07:10:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508190294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:10:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835099571] [2025-03-08 07:10:54,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 07:10:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:54,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:54,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:10:54,387 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-08 07:10:54,400 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:10:54,400 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 07:10:54,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:54,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 07:10:54,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:54,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835099571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:54,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:10:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-08 07:10:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381455589] [2025-03-08 07:10:54,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:54,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:10:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:54,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:10:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:10:54,638 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-03-08 07:10:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:54,755 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2025-03-08 07:10:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:10:54,757 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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 24 [2025-03-08 07:10:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:54,757 INFO L225 Difference]: With dead ends: 86 [2025-03-08 07:10:54,757 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 07:10:54,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2025-03-08 07:10:54,758 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:54,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 326 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 07:10:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 07:10:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 07:10:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-08 07:10:54,770 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 24 [2025-03-08 07:10:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:54,770 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-08 07:10:54,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-03-08 07:10:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-03-08 07:10:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 07:10:54,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:54,771 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:54,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:10:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:54,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -466496151, now seen corresponding path program 5 times [2025-03-08 07:10:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-08 07:10:54,972 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 07:10:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:54,976 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-03-08 07:10:54,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 07:10:54,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 07:10:54,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:10:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-08 07:10:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068500324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:10:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454978510] [2025-03-08 07:10:55,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 07:10:55,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:55,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:55,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:10:55,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-03-08 07:10:55,131 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 07:10:55,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 07:10:55,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:55,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 07:10:55,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:55,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454978510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:55,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:10:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-03-08 07:10:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842533449] [2025-03-08 07:10:55,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:55,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 07:10:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:55,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 07:10:55,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 07:10:55,366 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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-03-08 07:10:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:55,454 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-08 07:10:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:10:55,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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 26 [2025-03-08 07:10:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:55,456 INFO L225 Difference]: With dead ends: 65 [2025-03-08 07:10:55,456 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 07:10:55,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-08 07:10:55,457 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:55,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 07:10:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 07:10:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 07:10:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-03-08 07:10:55,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 26 [2025-03-08 07:10:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:55,462 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-03-08 07:10:55,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 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-03-08 07:10:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-03-08 07:10:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 07:10:55,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:55,462 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:55,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:10:55,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:55,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:55,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash -132777785, now seen corresponding path program 1 times [2025-03-08 07:10:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:55,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-03-08 07:10:55,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:55,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 07:10:55,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 07:10:55,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 07:10:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933070896] [2025-03-08 07:10:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:55,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:55,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:10:55,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 07:10:55,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 07:10:55,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:55,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:55,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 07:10:55,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:10:55,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:10:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:10:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-03-08 07:10:56,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 07:10:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933070896] [2025-03-08 07:10:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933070896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:56,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:10:56,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-08 07:10:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106320545] [2025-03-08 07:10:56,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:56,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 07:10:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:10:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 07:10:56,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 07:10:56,073 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 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-03-08 07:10:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:56,193 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-08 07:10:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 07:10:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 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 27 [2025-03-08 07:10:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:56,194 INFO L225 Difference]: With dead ends: 48 [2025-03-08 07:10:56,194 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 07:10:56,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 07:10:56,195 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:56,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 342 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 07:10:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 07:10:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:10:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-08 07:10:56,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 27 [2025-03-08 07:10:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:56,198 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-08 07:10:56,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 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-03-08 07:10:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-08 07:10:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 07:10:56,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:56,198 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:56,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 07:10:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:56,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -33469512, now seen corresponding path program 1 times [2025-03-08 07:10:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:10:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369482989] [2025-03-08 07:10:56,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:10:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 07:10:56,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 07:10:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:10:56,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 07:10:56,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 07:10:56,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 07:10:56,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:56,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:10:56,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 07:10:56,435 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 07:10:56,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 07:10:56,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 07:10:56,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:10:56,440 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-08 07:10:56,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 07:10:56,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:10:56 BoogieIcfgContainer [2025-03-08 07:10:56,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 07:10:56,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 07:10:56,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 07:10:56,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 07:10:56,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:51" (3/4) ... [2025-03-08 07:10:56,467 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 07:10:56,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 07:10:56,468 INFO L158 Benchmark]: Toolchain (without parser) took 5427.47ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.6MB in the end (delta: 11.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-03-08 07:10:56,468 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.01ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: Boogie Preprocessor took 33.54ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: IcfgBuilder took 247.12ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 76.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: TraceAbstraction took 4920.18ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 93.6MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:10:56,469 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 93.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:10:56,470 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.40ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.01ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.54ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.12ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 76.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4920.18ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 93.6MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 93.6MB in the end (delta: 41.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L100] CALL, EXPR f(IN) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L100] RET, EXPR f(IN) VAL [IN=112] [L100] CALL, EXPR fp(IN) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L100] RET, EXPR fp(IN) VAL [IN=112] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=112, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=112, x=110] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L104] RET, EXPR f(x) VAL [IN=112, x=111] [L104] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L104] RET, EXPR fp(x) VAL [IN=112, x=111] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=112] [L109] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 68 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 2248 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1895 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 353 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 68, 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, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 340 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1960 SizeOfPredicates, 18 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 112/420 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 could not prove your program: unable to determine feasibility of some traces [2025-03-08 07:10:56,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_3_6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2ff4855d3411c2183b4955db69fb0d32886e02ca6014c3e616f77788a55bdc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:10:58,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:10:58,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 07:10:58,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:10:58,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:10:58,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:10:58,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:10:58,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:10:58,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:10:58,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:10:58,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:10:58,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:10:58,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:10:58,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:10:58,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:10:58,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:10:58,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:10:58,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2ff4855d3411c2183b4955db69fb0d32886e02ca6014c3e616f77788a55bdc3 [2025-03-08 07:10:58,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:10:58,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:10:58,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:10:58,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:10:58,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:10:58,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_6.i [2025-03-08 07:10:59,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ddd61ab/35c92a24c89348b7be6bdd3ca208eaa1/FLAGa03ed8d80 [2025-03-08 07:10:59,975 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:10:59,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i [2025-03-08 07:10:59,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ddd61ab/35c92a24c89348b7be6bdd3ca208eaa1/FLAGa03ed8d80 [2025-03-08 07:10:59,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ddd61ab/35c92a24c89348b7be6bdd3ca208eaa1 [2025-03-08 07:11:00,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:11:00,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:11:00,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:11:00,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:11:00,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:11:00,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:59" (1/1) ... [2025-03-08 07:11:00,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7768fb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00, skipping insertion in model container [2025-03-08 07:11:00,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:59" (1/1) ... [2025-03-08 07:11:00,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:11:00,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[1224,1237] [2025-03-08 07:11:00,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[2848,2861] [2025-03-08 07:11:00,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:11:00,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:11:00,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[1224,1237] [2025-03-08 07:11:00,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_6.i[2848,2861] [2025-03-08 07:11:00,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:11:00,228 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:11:00,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00 WrapperNode [2025-03-08 07:11:00,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:11:00,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:11:00,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:11:00,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:11:00,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,265 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2025-03-08 07:11:00,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:11:00,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:11:00,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:11:00,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:11:00,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,291 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 07:11:00,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:11:00,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:11:00,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:11:00,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:11:00,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (1/1) ... [2025-03-08 07:11:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:11:00,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:00,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:11:00,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:11:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:11:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 07:11:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 07:11:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-08 07:11:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-08 07:11:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 07:11:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 07:11:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:11:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:11:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 07:11:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 07:11:00,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:11:00,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:11:14,612 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 07:11:14,612 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:11:14,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:11:14,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:11:14,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:11:14 BoogieIcfgContainer [2025-03-08 07:11:14,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:11:14,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:11:14,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:11:14,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:11:14,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:10:59" (1/3) ... [2025-03-08 07:11:14,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11557999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:11:14, skipping insertion in model container [2025-03-08 07:11:14,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:11:00" (2/3) ... [2025-03-08 07:11:14,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11557999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:11:14, skipping insertion in model container [2025-03-08 07:11:14,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:11:14" (3/3) ... [2025-03-08 07:11:14,629 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_6.i [2025-03-08 07:11:14,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:11:14,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_6.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 07:11:14,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:11:14,679 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;@6d6c76da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:11:14,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:11:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 07:11:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:11:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:14,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:14,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:14,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1457985862, now seen corresponding path program 1 times [2025-03-08 07:11:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321237725] [2025-03-08 07:11:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:11:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:14,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:11:14,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:11:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:11:14,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:11:14,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:11:14,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:11:14,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 07:11:14,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:11:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:14,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:11:14,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:11:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321237725] [2025-03-08 07:11:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321237725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:11:14,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:11:14,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:11:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127450658] [2025-03-08 07:11:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:11:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:11:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:11:14,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:11:14,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:11:14,911 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:11:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:11:15,034 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-03-08 07:11:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:11:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-08 07:11:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:11:15,045 INFO L225 Difference]: With dead ends: 87 [2025-03-08 07:11:15,045 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 07:11:15,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:11:15,051 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:11:15,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:11:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 07:11:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-08 07:11:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:11:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 07:11:15,080 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-03-08 07:11:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:11:15,080 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 07:11:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-08 07:11:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 07:11:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 07:11:15,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:15,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:15,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:11:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:15,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1340124501, now seen corresponding path program 1 times [2025-03-08 07:11:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639137073] [2025-03-08 07:11:15,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:11:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:15,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:11:15,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:11:15,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 07:11:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 07:11:15,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:11:15,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:11:15,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 07:11:15,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:11:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:15,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:11:15,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:11:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639137073] [2025-03-08 07:11:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639137073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:11:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:11:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:11:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528315846] [2025-03-08 07:11:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:11:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:11:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:11:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:11:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:11:15,460 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-08 07:11:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:11:15,597 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-08 07:11:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:11:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-03-08 07:11:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:11:15,599 INFO L225 Difference]: With dead ends: 53 [2025-03-08 07:11:15,599 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 07:11:15,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:11:15,600 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:11:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:11:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 07:11:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 07:11:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:11:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 07:11:15,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 12 [2025-03-08 07:11:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:11:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 07:11:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-08 07:11:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 07:11:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 07:11:15,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:15,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:15,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:11:15,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:15,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2023584397, now seen corresponding path program 1 times [2025-03-08 07:11:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581373042] [2025-03-08 07:11:15,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:11:15,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:15,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:15,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:11:15,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:11:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 07:11:15,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 07:11:15,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:11:15,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:11:15,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 07:11:15,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:11:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:16,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:11:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:16,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:11:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581373042] [2025-03-08 07:11:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581373042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:11:16,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:11:16,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 07:11:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950007960] [2025-03-08 07:11:16,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:11:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:11:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:11:16,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:11:16,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:11:16,608 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:11:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:11:17,034 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-03-08 07:11:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:11:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 07:11:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:11:17,036 INFO L225 Difference]: With dead ends: 57 [2025-03-08 07:11:17,036 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 07:11:17,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:11:17,037 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:11:17,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:11:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 07:11:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-08 07:11:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:11:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-08 07:11:17,047 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-03-08 07:11:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:11:17,047 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-08 07:11:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:11:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-08 07:11:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 07:11:17,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:17,048 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:17,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:11:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:17,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:17,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1509865745, now seen corresponding path program 1 times [2025-03-08 07:11:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543336735] [2025-03-08 07:11:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:11:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:17,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:11:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:11:17,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 07:11:17,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 07:11:17,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:11:17,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:11:17,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 07:11:17,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:11:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:18,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:11:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:11:18,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:11:18,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543336735] [2025-03-08 07:11:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543336735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:11:18,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:11:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 07:11:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408855883] [2025-03-08 07:11:18,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:11:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:11:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:11:18,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:11:18,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:11:18,718 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-03-08 07:11:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:11:19,793 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-03-08 07:11:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:11:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 18 [2025-03-08 07:11:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:11:19,794 INFO L225 Difference]: With dead ends: 65 [2025-03-08 07:11:19,794 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 07:11:19,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:11:19,795 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:11:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 219 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:11:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 07:11:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-08 07:11:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:11:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-08 07:11:19,800 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 18 [2025-03-08 07:11:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:11:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-08 07:11:19,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-03-08 07:11:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-08 07:11:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:11:19,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:19,801 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:19,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:11:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:20,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 263410028, now seen corresponding path program 2 times [2025-03-08 07:11:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956543496] [2025-03-08 07:11:20,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:11:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:11:20,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:11:20,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:11:20,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 07:11:20,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:11:20,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:11:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:11:20,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:11:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:11:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:11:21,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:11:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:11:32,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:11:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956543496] [2025-03-08 07:11:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956543496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:11:32,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:11:32,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2025-03-08 07:11:32,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918331176] [2025-03-08 07:11:32,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:11:32,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 07:11:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:11:32,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 07:11:32,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:11:32,976 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:11:45,780 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 07:11:50,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:54,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:56,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:12:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:12:08,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:12:11,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:12:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:12:18,173 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2025-03-08 07:12:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 07:12:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 07:12:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:12:18,181 INFO L225 Difference]: With dead ends: 73 [2025-03-08 07:12:18,181 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 07:12:18,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-08 07:12:18,182 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:12:18,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 480 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 3 Unknown, 0 Unchecked, 22.8s Time] [2025-03-08 07:12:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 07:12:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-08 07:12:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.24) internal successors, (62), 54 states have internal predecessors, (62), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 07:12:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-08 07:12:18,195 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 22 [2025-03-08 07:12:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:12:18,195 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-08 07:12:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:12:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-08 07:12:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 07:12:18,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:12:18,197 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:12:18,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:12:18,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:12:18,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:12:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:12:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 344893354, now seen corresponding path program 3 times [2025-03-08 07:12:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:12:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493056802] [2025-03-08 07:12:18,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 07:12:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:12:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:12:18,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:12:18,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:12:18,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 7 equivalence classes. [2025-03-08 07:12:18,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 07:12:18,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 07:12:18,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:12:18,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:12:18,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:12:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 07:12:19,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:12:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 07:12:24,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:12:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493056802] [2025-03-08 07:12:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493056802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:12:24,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:12:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2025-03-08 07:12:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097103708] [2025-03-08 07:12:24,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:12:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 07:12:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:12:24,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 07:12:24,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:12:24,416 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-03-08 07:12:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:12:25,434 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2025-03-08 07:12:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:12:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 24 [2025-03-08 07:12:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:12:25,436 INFO L225 Difference]: With dead ends: 86 [2025-03-08 07:12:25,436 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 07:12:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:12:25,437 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:12:25,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:12:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 07:12:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 07:12:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 07:12:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-08 07:12:25,447 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 24 [2025-03-08 07:12:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:12:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-08 07:12:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-03-08 07:12:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-08 07:12:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 07:12:25,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:12:25,448 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:12:25,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 07:12:25,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:12:25,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:12:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:12:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -132777785, now seen corresponding path program 1 times [2025-03-08 07:12:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:12:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549725921] [2025-03-08 07:12:25,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:12:25,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:12:25,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:12:25,653 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:12:25,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 07:12:25,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 07:12:25,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 07:12:25,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:12:25,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:12:25,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:12:25,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:12:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:12:28,906 INFO L312 TraceCheckSpWp]: Computing backward predicates...