./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_4.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 f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:59:06,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:59:06,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:59:06,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:59:06,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:59:06,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:59:06,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:59:06,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:59:06,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:59:06,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:59:06,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:59:06,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:59:06,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:59:06,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:59:06,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:59:06,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:59:06,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:59:06,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:59:06,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:59:06,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:59:06,108 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2025-03-03 15:59:06,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:59:06,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:59:06,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:59:06,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:59:06,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:59:06,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-03-03 15:59:07,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4574127/cfe03c7c0b7d444a952a07af8d5e3c38/FLAGff44ea40e [2025-03-03 15:59:07,786 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:59:07,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-03-03 15:59:07,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4574127/cfe03c7c0b7d444a952a07af8d5e3c38/FLAGff44ea40e [2025-03-03 15:59:07,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4574127/cfe03c7c0b7d444a952a07af8d5e3c38 [2025-03-03 15:59:07,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:59:07,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:59:07,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:59:07,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:59:07,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:59:07,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:07,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5de3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07, skipping insertion in model container [2025-03-03 15:59:07,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:07,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:59:07,927 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_4.i[1224,1237] [2025-03-03 15:59:07,944 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_4.i[2848,2861] [2025-03-03 15:59:07,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:59:07,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:59:07,962 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_4.i[1224,1237] [2025-03-03 15:59:07,971 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_4.i[2848,2861] [2025-03-03 15:59:07,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:59:07,981 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:59:07,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07 WrapperNode [2025-03-03 15:59:07,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:59:07,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:59:07,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:59:07,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:59:07,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:07,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,011 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2025-03-03 15:59:08,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:59:08,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:59:08,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:59:08,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:59:08,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,027 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-03 15:59:08,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:59:08,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:59:08,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:59:08,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:59:08,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (1/1) ... [2025-03-03 15:59:08,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:59:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:08,065 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-03 15:59:08,069 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-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-03 15:59:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-03 15:59:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:59:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:59:08,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:59:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 15:59:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 15:59:08,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:59:08,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:59:08,268 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 15:59:08,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:59:08,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:59:08,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:59:08,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:59:08 BoogieIcfgContainer [2025-03-03 15:59:08,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:59:08,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:59:08,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:59:08,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:59:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:59:07" (1/3) ... [2025-03-03 15:59:08,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109d02c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:59:08, skipping insertion in model container [2025-03-03 15:59:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:07" (2/3) ... [2025-03-03 15:59:08,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109d02c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:59:08, skipping insertion in model container [2025-03-03 15:59:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:59:08" (3/3) ... [2025-03-03 15:59:08,281 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2025-03-03 15:59:08,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:59:08,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_4.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 15:59:08,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:59:08,331 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;@349cbd46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:59:08,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:59:08,335 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-03 15:59:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 15:59:08,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:08,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:08,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:08,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1457985862, now seen corresponding path program 1 times [2025-03-03 15:59:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953897016] [2025-03-03 15:59:08,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:08,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 15:59:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 15:59:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:08,516 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-03 15:59:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953897016] [2025-03-03 15:59:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953897016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:59:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:59:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:59:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509729698] [2025-03-03 15:59:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:59:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:59:08,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:08,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:59:08,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:59:08,538 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-03 15:59:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:08,583 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2025-03-03 15:59:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:59:08,585 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-03 15:59:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:08,589 INFO L225 Difference]: With dead ends: 86 [2025-03-03 15:59:08,589 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 15:59:08,593 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-03 15:59:08,595 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-03 15:59:08,596 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-03 15:59:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 15:59:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 15:59:08,623 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-03 15:59:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-03 15:59:08,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 11 [2025-03-03 15:59:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:08,628 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-03 15:59:08,628 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-03 15:59:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-03 15:59:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 15:59:08,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:08,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:08,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:59:08,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:08,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1949477753, now seen corresponding path program 1 times [2025-03-03 15:59:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180674868] [2025-03-03 15:59:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:08,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 15:59:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 15:59:08,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:08,709 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-03 15:59:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180674868] [2025-03-03 15:59:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180674868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:59:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:59:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:59:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225268430] [2025-03-03 15:59:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:59:08,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:59:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:08,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:59:08,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:59:08,711 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-03 15:59:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:08,732 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-03 15:59:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:59:08,732 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-03 15:59:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:08,733 INFO L225 Difference]: With dead ends: 60 [2025-03-03 15:59:08,733 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 15:59:08,734 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-03 15:59:08,735 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-03 15:59:08,735 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-03 15:59:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 15:59:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-03-03 15:59:08,739 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-03 15:59:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-03 15:59:08,740 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 11 [2025-03-03 15:59:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-03 15:59:08,740 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-03 15:59:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-03 15:59:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 15:59:08,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:08,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:08,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:59:08,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2023584397, now seen corresponding path program 1 times [2025-03-03 15:59:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859732365] [2025-03-03 15:59:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 15:59:08,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 15:59:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:08,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:08,845 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-03 15:59:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:08,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859732365] [2025-03-03 15:59:08,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859732365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:59:08,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:59:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:59:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753987939] [2025-03-03 15:59:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:59:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:59:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:59:08,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:59:08,847 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-03 15:59:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:08,870 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-03 15:59:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:59:08,871 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-03 15:59:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:08,873 INFO L225 Difference]: With dead ends: 54 [2025-03-03 15:59:08,873 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 15:59:08,874 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-03 15:59:08,875 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-03 15:59:08,875 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-03 15:59:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 15:59:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-03 15:59:08,879 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-03 15:59:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-03 15:59:08,880 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 14 [2025-03-03 15:59:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:08,880 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-03 15:59:08,880 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-03 15:59:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-03 15:59:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 15:59:08,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:08,881 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:08,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:59:08,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:08,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1566506481, now seen corresponding path program 1 times [2025-03-03 15:59:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498087139] [2025-03-03 15:59:08,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:08,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 15:59:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 15:59:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:08,994 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-03 15:59:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498087139] [2025-03-03 15:59:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498087139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:59:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749853077] [2025-03-03 15:59:08,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:08,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:08,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:08,998 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-03 15:59:09,007 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-03 15:59:09,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 15:59:09,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 15:59:09,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:09,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:09,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 15:59:09,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:09,145 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-03 15:59:09,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:09,212 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-03 15:59:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749853077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:09,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:59:09,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-03 15:59:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941975819] [2025-03-03 15:59:09,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:09,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:59:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:59:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:59:09,216 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-03 15:59:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:09,263 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-03 15:59:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:59:09,265 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-03 15:59:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:09,267 INFO L225 Difference]: With dead ends: 58 [2025-03-03 15:59:09,267 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 15:59:09,267 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-03 15:59:09,267 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-03 15:59:09,268 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-03 15:59:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 15:59:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 15:59:09,272 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-03 15:59:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-03 15:59:09,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-03-03 15:59:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:09,273 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-03 15:59:09,273 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-03 15:59:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-03 15:59:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 15:59:09,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:09,274 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:09,280 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-03 15:59:09,474 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-03 15:59:09,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:09,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1328892013, now seen corresponding path program 2 times [2025-03-03 15:59:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:09,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292764893] [2025-03-03 15:59:09,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:59:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:09,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 15:59:09,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 15:59:09,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:59:09,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:09,641 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-03 15:59:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292764893] [2025-03-03 15:59:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292764893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:59:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487096679] [2025-03-03 15:59:09,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:59:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:09,644 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-03 15:59:09,646 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-03 15:59:09,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 15:59:09,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 15:59:09,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:59:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:09,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 15:59:09,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:09,803 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-03 15:59:09,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:09,897 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-03 15:59:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487096679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:09,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:59:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-03 15:59:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485237845] [2025-03-03 15:59:09,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 15:59:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:09,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 15:59:09,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:59:09,899 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-03 15:59:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:09,992 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-03-03 15:59:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:59:09,993 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-03 15:59:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:09,993 INFO L225 Difference]: With dead ends: 67 [2025-03-03 15:59:09,993 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 15:59:09,994 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-03 15:59:09,994 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-03 15:59:09,994 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-03 15:59:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 15:59:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-03 15:59:10,001 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-03 15:59:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-03 15:59:10,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-03-03 15:59:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:10,003 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-03 15:59:10,003 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-03 15:59:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-03 15:59:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 15:59:10,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:10,004 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:10,011 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-03 15:59:10,204 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-03 15:59:10,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:10,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash 263410028, now seen corresponding path program 3 times [2025-03-03 15:59:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575409234] [2025-03-03 15:59:10,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 15:59:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:10,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-03 15:59:10,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 15:59:10,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 15:59:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 15:59:10,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384843115] [2025-03-03 15:59:10,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 15:59:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:10,236 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-03 15:59:10,238 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-03 15:59:10,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-03 15:59:10,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 22 statements. [2025-03-03 15:59:10,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 15:59:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:10,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 15:59:10,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:10,425 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-03 15:59:10,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:10,691 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-03 15:59:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575409234] [2025-03-03 15:59:10,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 15:59:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384843115] [2025-03-03 15:59:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384843115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:10,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:59:10,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 15:59:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547251227] [2025-03-03 15:59:10,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:59:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:10,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:59:10,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:59:10,694 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-03 15:59:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:10,904 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2025-03-03 15:59:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:59:10,905 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-03 15:59:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:10,906 INFO L225 Difference]: With dead ends: 72 [2025-03-03 15:59:10,907 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 15:59:10,907 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-03 15:59:10,908 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-03 15:59:10,908 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-03 15:59:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 15:59:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-03 15:59:10,917 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-03 15:59:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-03-03 15:59:10,918 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2025-03-03 15:59:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-03-03 15:59:10,918 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-03 15:59:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-03-03 15:59:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 15:59:10,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:10,919 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:10,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:59:11,123 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-03 15:59:11,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:11,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1462561109, now seen corresponding path program 4 times [2025-03-03 15:59:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:11,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556240806] [2025-03-03 15:59:11,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 15:59:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:11,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-03 15:59:11,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 15:59:11,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 15:59:11,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:11,246 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-03 15:59:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556240806] [2025-03-03 15:59:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556240806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:59:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825746539] [2025-03-03 15:59:11,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 15:59:11,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:11,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:11,249 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-03 15:59:11,251 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-03 15:59:11,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-03 15:59:11,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 15:59:11,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 15:59:11,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:11,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 15:59:11,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:11,420 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-03 15:59:11,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:11,529 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-03 15:59:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825746539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:11,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:59:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-03 15:59:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86610580] [2025-03-03 15:59:11,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 15:59:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:11,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 15:59:11,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:59:11,531 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-03 15:59:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:11,648 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2025-03-03 15:59:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:59:11,650 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-03 15:59:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:11,650 INFO L225 Difference]: With dead ends: 86 [2025-03-03 15:59:11,651 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 15:59:11,651 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-03 15:59:11,651 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-03 15:59:11,652 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-03 15:59:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 15:59:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-03 15:59:11,656 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-03 15:59:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-03 15:59:11,657 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 24 [2025-03-03 15:59:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-03 15:59:11,657 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-03 15:59:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-03-03 15:59:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 15:59:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:11,658 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:11,664 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-03 15:59:11,858 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-03 15:59:11,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:11,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash -466496151, now seen corresponding path program 5 times [2025-03-03 15:59:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:11,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077756291] [2025-03-03 15:59:11,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 15:59:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:11,863 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-03-03 15:59:11,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 15:59:11,868 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 15:59:11,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:11,971 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-03 15:59:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077756291] [2025-03-03 15:59:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077756291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:59:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254524235] [2025-03-03 15:59:11,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 15:59:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:11,975 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-03 15:59:11,976 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-03 15:59:12,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 8 equivalence classes. [2025-03-03 15:59:12,015 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 15:59:12,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 15:59:12,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 15:59:12,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:12,121 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-03 15:59:12,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:12,261 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-03 15:59:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254524235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:12,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:59:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-03-03 15:59:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459273712] [2025-03-03 15:59:12,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:12,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:59:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:12,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:59:12,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:59:12,266 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-03 15:59:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:12,345 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-03 15:59:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:59:12,346 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-03 15:59:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:12,347 INFO L225 Difference]: With dead ends: 65 [2025-03-03 15:59:12,347 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 15:59:12,347 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-03 15:59:12,347 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-03 15:59:12,348 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-03 15:59:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 15:59:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 15:59:12,355 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-03 15:59:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-03-03 15:59:12,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 26 [2025-03-03 15:59:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:12,356 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-03-03 15:59:12,356 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-03 15:59:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-03-03 15:59:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 15:59:12,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:12,357 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-03 15:59:12,364 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-03 15:59:12,558 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-03 15:59:12,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:12,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash -132777785, now seen corresponding path program 1 times [2025-03-03 15:59:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161275186] [2025-03-03 15:59:12,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:12,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 15:59:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 15:59:12,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:12,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 15:59:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432847511] [2025-03-03 15:59:12,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:12,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:12,575 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-03 15:59:12,576 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-03 15:59:12,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 15:59:12,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 15:59:12,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:12,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:12,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 15:59:12,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:12,717 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-03 15:59:12,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:12,956 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-03 15:59:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:59:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161275186] [2025-03-03 15:59:12,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 15:59:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432847511] [2025-03-03 15:59:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432847511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:12,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:59:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-03 15:59:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169363648] [2025-03-03 15:59:12,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:12,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:59:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:59:12,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:59:12,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:59:12,958 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-03 15:59:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:13,092 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-03 15:59:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:59:13,092 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-03 15:59:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:13,092 INFO L225 Difference]: With dead ends: 48 [2025-03-03 15:59:13,092 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 15:59:13,093 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-03 15:59:13,093 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-03 15:59:13,093 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-03 15:59:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 15:59:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 15:59:13,097 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-03 15:59:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-03 15:59:13,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 27 [2025-03-03 15:59:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:13,097 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-03 15:59:13,097 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-03 15:59:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-03 15:59:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 15:59:13,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:13,098 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-03 15:59:13,104 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-03 15:59:13,298 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-03 15:59:13,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:13,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash -33469512, now seen corresponding path program 1 times [2025-03-03 15:59:13,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:59:13,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337186179] [2025-03-03 15:59:13,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:59:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 15:59:13,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 15:59:13,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 15:59:13,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 15:59:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 15:59:13,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 15:59:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 15:59:13,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 15:59:13,326 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 15:59:13,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 15:59:13,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 15:59:13,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:59:13,331 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-03 15:59:13,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 15:59:13,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 03:59:13 BoogieIcfgContainer [2025-03-03 15:59:13,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 15:59:13,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 15:59:13,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 15:59:13,346 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 15:59:13,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:59:08" (3/4) ... [2025-03-03 15:59:13,348 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 15:59:13,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 15:59:13,349 INFO L158 Benchmark]: Toolchain (without parser) took 5536.61ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 117.8MB in the end (delta: 4.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2025-03-03 15:59:13,349 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 15:59:13,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.70ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 15:59:13,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.43ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 15:59:13,349 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 107.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 15:59:13,349 INFO L158 Benchmark]: IcfgBuilder took 241.12ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 92.7MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 15:59:13,350 INFO L158 Benchmark]: TraceAbstraction took 5069.20ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 117.8MB in the end (delta: -25.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 15:59:13,350 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 117.8MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 15:59:13,350 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.23ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.70ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.43ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 107.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.12ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 92.7MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5069.20ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 117.8MB in the end (delta: -25.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 117.8MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 102, overapproximation of someBinaryArithmeticFLOAToperation at line 104, overapproximation of someBinaryArithmeticFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 100. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.8f && IN < 0.8f) [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, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, 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.3s 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-03 15:59:13,365 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_4.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 f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:59:15,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:59:15,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 15:59:15,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:59:15,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:59:15,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:59:15,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:59:15,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:59:15,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:59:15,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:59:15,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:59:15,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:59:15,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:59:15,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:59:15,292 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:59:15,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:59:15,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:59:15,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:59:15,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:59:15,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:59:15,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:59:15,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:59:15,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:59:15,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:59:15,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:59:15,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:59:15,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:59:15,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:59:15,296 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2025-03-03 15:59:15,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:59:15,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:59:15,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:59:15,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:59:15,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:59:15,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-03-03 15:59:16,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb32d66ea/a4fc9f4e750843748819878f25ac1873/FLAG630a6b62d [2025-03-03 15:59:16,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:59:16,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2025-03-03 15:59:16,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb32d66ea/a4fc9f4e750843748819878f25ac1873/FLAG630a6b62d [2025-03-03 15:59:17,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb32d66ea/a4fc9f4e750843748819878f25ac1873 [2025-03-03 15:59:17,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:59:17,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:59:17,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:59:17,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:59:17,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:59:17,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0adccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17, skipping insertion in model container [2025-03-03 15:59:17,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:59:17,430 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_4.i[1224,1237] [2025-03-03 15:59:17,446 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_4.i[2848,2861] [2025-03-03 15:59:17,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:59:17,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:59:17,467 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_4.i[1224,1237] [2025-03-03 15:59:17,476 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_4.i[2848,2861] [2025-03-03 15:59:17,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:59:17,491 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:59:17,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17 WrapperNode [2025-03-03 15:59:17,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:59:17,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:59:17,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:59:17,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:59:17,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,518 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2025-03-03 15:59:17,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:59:17,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:59:17,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:59:17,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:59:17,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,547 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-03 15:59:17,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:59:17,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:59:17,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:59:17,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:59:17,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (1/1) ... [2025-03-03 15:59:17,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:59:17,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:17,593 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-03 15:59:17,596 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-03 15:59:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:59:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 15:59:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 15:59:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-03 15:59:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-03 15:59:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-03 15:59:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-03 15:59:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:59:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:59:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 15:59:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 15:59:17,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:59:17,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:59:32,691 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 15:59:32,691 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:59:32,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:59:32,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:59:32,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:59:32 BoogieIcfgContainer [2025-03-03 15:59:32,699 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:59:32,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:59:32,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:59:32,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:59:32,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:59:17" (1/3) ... [2025-03-03 15:59:32,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8834019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:59:32, skipping insertion in model container [2025-03-03 15:59:32,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:59:17" (2/3) ... [2025-03-03 15:59:32,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8834019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:59:32, skipping insertion in model container [2025-03-03 15:59:32,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:59:32" (3/3) ... [2025-03-03 15:59:32,707 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2025-03-03 15:59:32,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:59:32,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_3_4.i that has 4 procedures, 45 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 15:59:32,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:59:32,761 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;@774c03f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:59:32,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:59:32,764 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-03 15:59:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 15:59:32,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:32,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:32,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:32,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1457985862, now seen corresponding path program 1 times [2025-03-03 15:59:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 15:59:32,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366023157] [2025-03-03 15:59:32,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:32,781 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-03 15:59:32,782 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-03 15:59:32,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 15:59:32,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 15:59:32,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:32,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:32,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 15:59:32,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:32,968 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-03 15:59:32,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:59:32,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 15:59:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366023157] [2025-03-03 15:59:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366023157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:59:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:59:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:59:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813318672] [2025-03-03 15:59:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:59:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:59:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 15:59:32,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:59:32,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:59:32,987 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-03 15:59:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:33,102 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-03-03 15:59:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:59:33,104 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-03 15:59:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:33,108 INFO L225 Difference]: With dead ends: 87 [2025-03-03 15:59:33,108 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 15:59:33,110 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-03 15:59:33,111 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-03 15:59:33,112 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-03 15:59:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 15:59:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-03 15:59:33,132 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-03 15:59:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-03 15:59:33,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-03-03 15:59:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:33,139 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-03 15:59:33,139 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-03 15:59:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-03 15:59:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 15:59:33,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:33,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:33,148 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-03 15:59:33,340 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-03 15:59:33,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:33,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1340124501, now seen corresponding path program 1 times [2025-03-03 15:59:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 15:59:33,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897424026] [2025-03-03 15:59:33,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:33,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:33,344 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-03 15:59:33,344 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-03 15:59:33,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 15:59:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 15:59:33,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 15:59:33,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:33,481 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-03 15:59:33,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:59:33,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 15:59:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897424026] [2025-03-03 15:59:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897424026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:59:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:59:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:59:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024269888] [2025-03-03 15:59:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:59:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:59:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 15:59:33,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:59:33,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:59:33,483 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-03 15:59:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:33,603 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-03 15:59:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:59:33,604 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-03 15:59:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:33,605 INFO L225 Difference]: With dead ends: 53 [2025-03-03 15:59:33,605 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 15:59:33,605 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-03 15:59:33,606 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-03 15:59:33,606 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-03 15:59:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 15:59:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 15:59:33,610 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-03 15:59:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-03 15:59:33,611 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 12 [2025-03-03 15:59:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:33,611 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-03 15:59:33,611 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-03 15:59:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-03 15:59:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 15:59:33,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:33,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:33,619 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-03 15:59:33,812 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-03 15:59:33,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:33,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2023584397, now seen corresponding path program 1 times [2025-03-03 15:59:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 15:59:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186823354] [2025-03-03 15:59:33,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:33,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:33,819 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-03 15:59:33,820 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-03 15:59:33,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 15:59:33,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 15:59:33,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:33,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:33,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 15:59:33,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:34,241 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-03 15:59:34,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:34,521 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-03 15:59:34,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 15:59:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186823354] [2025-03-03 15:59:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186823354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:34,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:59:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 15:59:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455094569] [2025-03-03 15:59:34,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:59:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 15:59:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:59:34,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:59:34,523 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-03 15:59:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:34,909 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-03-03 15:59:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:59:34,910 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-03 15:59:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:34,910 INFO L225 Difference]: With dead ends: 57 [2025-03-03 15:59:34,910 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 15:59:34,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:59:34,911 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-03 15:59:34,911 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-03 15:59:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 15:59:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-03 15:59:34,915 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-03 15:59:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-03 15:59:34,916 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-03-03 15:59:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-03 15:59:34,916 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-03 15:59:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-03 15:59:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 15:59:34,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:34,916 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:34,924 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-03 15:59:35,118 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-03 15:59:35,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:35,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1509865745, now seen corresponding path program 1 times [2025-03-03 15:59:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 15:59:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61453329] [2025-03-03 15:59:35,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:59:35,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:35,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:35,123 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-03 15:59:35,124 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-03 15:59:35,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 15:59:35,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 15:59:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:59:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:35,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 15:59:35,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:35,972 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-03 15:59:35,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:36,687 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-03 15:59:36,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 15:59:36,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61453329] [2025-03-03 15:59:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61453329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:36,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:59:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 15:59:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321770872] [2025-03-03 15:59:36,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:59:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 15:59:36,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:59:36,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:59:36,691 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-03 15:59:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:59:37,846 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-03-03 15:59:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:59:37,846 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-03 15:59:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:59:37,847 INFO L225 Difference]: With dead ends: 65 [2025-03-03 15:59:37,847 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 15:59:37,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:59:37,848 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-03 15:59:37,848 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-03 15:59:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 15:59:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-03 15:59:37,853 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-03 15:59:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-03 15:59:37,853 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 18 [2025-03-03 15:59:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:59:37,854 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-03 15:59:37,854 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-03 15:59:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-03 15:59:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 15:59:37,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:59:37,854 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:59:37,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:59:38,055 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-03 15:59:38,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:59:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:59:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 263410028, now seen corresponding path program 2 times [2025-03-03 15:59:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 15:59:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805646996] [2025-03-03 15:59:38,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:59:38,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:59:38,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:59:38,058 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-03 15:59:38,058 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-03 15:59:38,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 15:59:38,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 15:59:38,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:59:38,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:59:38,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 15:59:38,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:59:40,075 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-03 15:59:40,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:59:51,211 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-03 15:59:51,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 15:59:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805646996] [2025-03-03 15:59:51,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805646996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:59:51,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:59:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2025-03-03 15:59:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878459880] [2025-03-03 15:59:51,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:59:51,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:59:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 15:59:51,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:59:51,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:59:51,213 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-03 16:00:03,464 WARN L286 SmtUtils]: Spent 6.62s 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-03 16:00:07,936 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-03 16:00:11,943 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-03 16:00:14,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 16:00:22,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 16:00:25,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 16:00:26,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 16:00:30,868 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-03 16:00:34,875 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-03 16:00:42,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 16:00:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:44,250 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2025-03-03 16:00:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:00:44,255 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-03 16:00:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:44,256 INFO L225 Difference]: With dead ends: 73 [2025-03-03 16:00:44,256 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 16:00:44,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:00:44,258 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:00:44,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 480 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 4 Unknown, 0 Unchecked, 31.6s Time] [2025-03-03 16:00:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 16:00:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-03 16:00:44,266 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-03 16:00:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-03 16:00:44,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 22 [2025-03-03 16:00:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:44,267 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-03 16:00:44,267 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-03 16:00:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-03 16:00:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:00:44,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:44,268 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:00:44,280 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-03 16:00:44,468 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-03 16:00:44,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:44,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash 344893354, now seen corresponding path program 3 times [2025-03-03 16:00:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:00:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778080311] [2025-03-03 16:00:44,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 16:00:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:44,471 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-03 16:00:44,472 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-03 16:00:44,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 7 equivalence classes. [2025-03-03 16:00:44,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:00:44,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 16:00:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:44,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:00:44,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:00:45,522 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-03 16:00:45,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:00:49,955 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-03 16:00:49,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:00:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778080311] [2025-03-03 16:00:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778080311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:00:49,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:00:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2025-03-03 16:00:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162768737] [2025-03-03 16:00:49,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 16:00:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 16:00:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:00:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 16:00:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:00:49,956 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-03 16:00:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:00:50,944 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2025-03-03 16:00:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:00:50,946 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-03 16:00:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:00:50,947 INFO L225 Difference]: With dead ends: 86 [2025-03-03 16:00:50,947 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 16:00:50,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:00:50,948 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-03 16:00:50,949 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-03 16:00:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 16:00:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 16:00:50,954 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-03 16:00:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-03 16:00:50,955 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 24 [2025-03-03 16:00:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:00:50,955 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-03 16:00:50,955 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-03 16:00:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-03 16:00:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 16:00:50,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:00:50,956 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-03 16:00:50,963 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-03 16:00:51,156 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-03 16:00:51,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:00:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:00:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -132777785, now seen corresponding path program 1 times [2025-03-03 16:00:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:00:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131550912] [2025-03-03 16:00:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:00:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:00:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:00:51,159 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-03 16:00:51,159 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-03 16:00:51,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 16:00:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 16:00:51,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:00:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:00:51,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:00:51,218 INFO L279 TraceCheckSpWp]: Computing forward predicates...