./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_2_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_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 289de09ea2f682a4c4668d6184c2af95807d8c0a5f7625690403c1e8c073d7a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:09:47,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:09:47,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:09:47,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:09:47,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:09:47,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:09:47,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:09:47,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:09:47,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:09:47,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:09:47,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:09:47,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:09:47,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:09:47,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:09:47,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:09:47,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:09:47,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:09:47,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:09:47,874 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 -> 289de09ea2f682a4c4668d6184c2af95807d8c0a5f7625690403c1e8c073d7a9 [2025-03-08 07:09:48,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:09:48,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:09:48,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:09:48,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:09:48,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:09:48,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_4.i [2025-03-08 07:09:49,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc505d52/65f13dcfc9e24888965c5467199cb35e/FLAG1af4bc168 [2025-03-08 07:09:49,451 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:09:49,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_4.i [2025-03-08 07:09:49,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc505d52/65f13dcfc9e24888965c5467199cb35e/FLAG1af4bc168 [2025-03-08 07:09:49,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc505d52/65f13dcfc9e24888965c5467199cb35e [2025-03-08 07:09:49,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:09:49,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:09:49,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:09:49,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:09:49,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:09:49,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1debcf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49, skipping insertion in model container [2025-03-08 07:09:49,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:09:49,619 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_2_4.i[1224,1237] [2025-03-08 07:09:49,644 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_2_4.i[2827,2840] [2025-03-08 07:09:49,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:09:49,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:09:49,662 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_2_4.i[1224,1237] [2025-03-08 07:09:49,673 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_2_4.i[2827,2840] [2025-03-08 07:09:49,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:09:49,685 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:09:49,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49 WrapperNode [2025-03-08 07:09:49,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:09:49,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:09:49,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:09:49,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:09:49,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,711 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2025-03-08 07:09:49,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:09:49,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:09:49,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:09:49,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:09:49,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,729 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 07:09:49,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:09:49,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:09:49,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:09:49,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:09:49,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (1/1) ... [2025-03-08 07:09:49,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:09:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:09:49,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:09:49,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-08 07:09:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 07:09:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:09:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:09:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 07:09:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 07:09:49,825 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:09:49,827 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:09:49,966 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 07:09:49,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:09:49,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:09:49,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:09:49,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:09:49 BoogieIcfgContainer [2025-03-08 07:09:49,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:09:49,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:09:49,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:09:49,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:09:49,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:09:49" (1/3) ... [2025-03-08 07:09:49,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1764e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:09:49, skipping insertion in model container [2025-03-08 07:09:49,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:49" (2/3) ... [2025-03-08 07:09:49,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1764e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:09:49, skipping insertion in model container [2025-03-08 07:09:49,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:09:49" (3/3) ... [2025-03-08 07:09:49,986 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_4.i [2025-03-08 07:09:49,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:09:50,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_2_4.i that has 4 procedures, 42 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 07:09:50,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:09:50,065 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;@701af7ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:09:50,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:09:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 07:09:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:09:50,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:50,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:50,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1151646490, now seen corresponding path program 1 times [2025-03-08 07:09:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600899020] [2025-03-08 07:09:50,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:50,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:09:50,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:09:50,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:50,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600899020] [2025-03-08 07:09:50,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600899020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:09:50,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:09:50,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:09:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612383534] [2025-03-08 07:09:50,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:09:50,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:09:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:50,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:09:50,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,265 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:50,307 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2025-03-08 07:09:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:09:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 07:09:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:50,312 INFO L225 Difference]: With dead ends: 80 [2025-03-08 07:09:50,313 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 07:09:50,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,317 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:50,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:09:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 07:09:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 07:09:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:09:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-08 07:09:50,341 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2025-03-08 07:09:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-08 07:09:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-08 07:09:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:09:50,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:50,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:09:50,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -264142809, now seen corresponding path program 1 times [2025-03-08 07:09:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485776452] [2025-03-08 07:09:50,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:09:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:09:50,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:50,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:50,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485776452] [2025-03-08 07:09:50,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485776452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:09:50,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:09:50,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:09:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53280740] [2025-03-08 07:09:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:09:50,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:09:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:50,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:09:50,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,427 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:50,445 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-03-08 07:09:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:09:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 07:09:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:50,447 INFO L225 Difference]: With dead ends: 57 [2025-03-08 07:09:50,447 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 07:09:50,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,448 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:50,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:09:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 07:09:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-03-08 07:09:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:09:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 07:09:50,453 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 11 [2025-03-08 07:09:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 07:09:50,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 07:09:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 07:09:50,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:50,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:50,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:09:50,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 373208147, now seen corresponding path program 1 times [2025-03-08 07:09:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721122880] [2025-03-08 07:09:50,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:50,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 07:09:50,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 07:09:50,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:50,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721122880] [2025-03-08 07:09:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721122880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:09:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:09:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:09:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161898640] [2025-03-08 07:09:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:09:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:09:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:50,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:09:50,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,553 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:50,571 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-08 07:09:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:09:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 07:09:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:50,573 INFO L225 Difference]: With dead ends: 51 [2025-03-08 07:09:50,573 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 07:09:50,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:09:50,574 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:50,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:09:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 07:09:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 07:09:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:09:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-08 07:09:50,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2025-03-08 07:09:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:50,595 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-08 07:09:50,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-08 07:09:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 07:09:50,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:50,596 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:09:50,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1424638767, now seen corresponding path program 1 times [2025-03-08 07:09:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855861000] [2025-03-08 07:09:50,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:50,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 07:09:50,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 07:09:50,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:50,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855861000] [2025-03-08 07:09:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855861000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:09:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527206215] [2025-03-08 07:09:50,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:50,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:09:50,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:09:50,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:09:50,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 07:09:50,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 07:09:50,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:50,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:50,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:09:50,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:09:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:09:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527206215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:09:50,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:09:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-08 07:09:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832875139] [2025-03-08 07:09:50,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:09:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:09:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:09:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:09:50,914 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:50,959 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-08 07:09:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:09:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 07:09:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:50,960 INFO L225 Difference]: With dead ends: 55 [2025-03-08 07:09:50,960 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 07:09:50,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:09:50,961 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:50,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:09:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 07:09:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 07:09:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:09:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-08 07:09:50,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 16 [2025-03-08 07:09:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:50,967 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-08 07:09:50,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-08 07:09:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 07:09:50,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:50,968 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:50,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:09:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:51,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 793720653, now seen corresponding path program 2 times [2025-03-08 07:09:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415648534] [2025-03-08 07:09:51,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:09:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:51,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 07:09:51,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 07:09:51,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:09:51,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:51,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:51,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415648534] [2025-03-08 07:09:51,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415648534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:09:51,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846784081] [2025-03-08 07:09:51,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:09:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:09:51,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:09:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:09:51,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 07:09:51,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 07:09:51,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:09:51,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:51,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 07:09:51,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:09:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:51,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:09:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:09:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846784081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:09:51,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:09:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-08 07:09:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382911013] [2025-03-08 07:09:51,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:09:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 07:09:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:51,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 07:09:51,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:09:51,510 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:51,610 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-03-08 07:09:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:09:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 07:09:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:51,612 INFO L225 Difference]: With dead ends: 64 [2025-03-08 07:09:51,612 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 07:09:51,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:09:51,613 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:51,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 282 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:09:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 07:09:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-08 07:09:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:09:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-08 07:09:51,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 20 [2025-03-08 07:09:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:51,619 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-08 07:09:51,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-08 07:09:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:09:51,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:51,621 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:51,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:09:51,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:51,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:51,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1448466508, now seen corresponding path program 3 times [2025-03-08 07:09:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178329425] [2025-03-08 07:09:51,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 07:09:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:51,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-08 07:09:51,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:09:51,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 07:09:51,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 07:09:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296319653] [2025-03-08 07:09:51,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 07:09:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:09:51,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:09:51,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:09:51,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-03-08 07:09:51,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 22 statements. [2025-03-08 07:09:51,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 07:09:51,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:09:51,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 07:09:51,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:09:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:09:51,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:09:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:09:52,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:09:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178329425] [2025-03-08 07:09:52,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 07:09:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296319653] [2025-03-08 07:09:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296319653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:09:52,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:09:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-08 07:09:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459316452] [2025-03-08 07:09:52,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:09:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 07:09:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:09:52,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 07:09:52,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 07:09:52,243 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:09:52,576 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-03-08 07:09:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:09:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 07:09:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:09:52,577 INFO L225 Difference]: With dead ends: 69 [2025-03-08 07:09:52,577 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 07:09:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:09:52,580 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:09:52,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 381 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:09:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 07:09:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-03-08 07:09:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:09:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-08 07:09:52,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 22 [2025-03-08 07:09:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:09:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-08 07:09:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:09:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-08 07:09:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 07:09:52,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:09:52,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:09:52,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:09:52,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:09:52,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:09:52,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:09:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1155762721, now seen corresponding path program 1 times [2025-03-08 07:09:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:09:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978591738] [2025-03-08 07:09:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:09:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:09:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 07:09:52,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 07:09:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:09:52,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 07:09:52,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 07:09:52,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 07:09:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:09:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:09:52,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 07:09:52,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 07:09:52,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 07:09:52,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 07:09:52,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:09:52,837 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-08 07:09:52,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 07:09:52,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:09:52 BoogieIcfgContainer [2025-03-08 07:09:52,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 07:09:52,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 07:09:52,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 07:09:52,856 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 07:09:52,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:09:49" (3/4) ... [2025-03-08 07:09:52,858 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 07:09:52,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 07:09:52,861 INFO L158 Benchmark]: Toolchain (without parser) took 3369.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.6MB in the beginning and 367.9MB in the end (delta: -254.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-03-08 07:09:52,861 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:09:52,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:09:52,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:09:52,862 INFO L158 Benchmark]: Boogie Preprocessor took 21.36ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:09:52,862 INFO L158 Benchmark]: IcfgBuilder took 241.22ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 84.1MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:09:52,863 INFO L158 Benchmark]: TraceAbstraction took 2877.14ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.2MB in the beginning and 367.9MB in the end (delta: -284.7MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2025-03-08 07:09:52,863 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 427.8MB. Free memory is still 367.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:09:52,864 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.36ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.22ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 84.1MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2877.14ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.2MB in the beginning and 367.9MB in the end (delta: -284.7MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 427.8MB. Free memory is still 367.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 87. 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)=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] [L100] RET, EXPR f(IN) VAL [IN=111] [L100] CALL, EXPR fp(IN) 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] [L100] RET, EXPR fp(IN) VAL [IN=111] [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=111, 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=111, x=110] [L102] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=111] [L109] reach_error() VAL [IN=111] - 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, 42 locations, 61 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 1039 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 824 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 215 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, InterpolantAutomatonStates: 40, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 177 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 896 SizeOfPredicates, 9 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 45/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 07:09:52,880 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_2_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 289de09ea2f682a4c4668d6184c2af95807d8c0a5f7625690403c1e8c073d7a9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:09:54,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:09:54,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 07:09:54,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:09:54,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:09:54,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:09:54,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:09:54,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:09:54,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:09:54,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:09:54,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:09:54,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:09:54,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:09:54,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:09:54,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:09:54,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:09:54,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:09:54,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:09:54,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:09:54,836 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 -> 289de09ea2f682a4c4668d6184c2af95807d8c0a5f7625690403c1e8c073d7a9 [2025-03-08 07:09:55,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:09:55,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:09:55,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:09:55,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:09:55,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:09:55,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_4.i [2025-03-08 07:09:56,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb25931a/767760f7cb9c49a5968a43b06e050cb9/FLAG6020f606e [2025-03-08 07:09:56,431 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:09:56,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_4.i [2025-03-08 07:09:56,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb25931a/767760f7cb9c49a5968a43b06e050cb9/FLAG6020f606e [2025-03-08 07:09:56,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bb25931a/767760f7cb9c49a5968a43b06e050cb9 [2025-03-08 07:09:56,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:09:56,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:09:56,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:09:56,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:09:56,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:09:56,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:09:56" (1/1) ... [2025-03-08 07:09:56,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d204faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:56, skipping insertion in model container [2025-03-08 07:09:56,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:09:56" (1/1) ... [2025-03-08 07:09:56,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:09:56,965 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_2_4.i[1224,1237] [2025-03-08 07:09:56,991 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_2_4.i[2827,2840] [2025-03-08 07:09:56,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:09:57,008 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:09:57,020 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_2_4.i[1224,1237] [2025-03-08 07:09:57,032 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_2_4.i[2827,2840] [2025-03-08 07:09:57,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:09:57,049 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:09:57,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57 WrapperNode [2025-03-08 07:09:57,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:09:57,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:09:57,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:09:57,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:09:57,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,084 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 73 [2025-03-08 07:09:57,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:09:57,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:09:57,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:09:57,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:09:57,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,109 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 07:09:57,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:09:57,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:09:57,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:09:57,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:09:57,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (1/1) ... [2025-03-08 07:09:57,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:09:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:09:57,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:09:57,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-08 07:09:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 07:09:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:09:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:09:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 07:09:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 07:09:57,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:09:57,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:10:11,012 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 07:10:11,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:10:11,019 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:10:11,019 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:10:11,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:11 BoogieIcfgContainer [2025-03-08 07:10:11,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:10:11,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:10:11,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:10:11,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:10:11,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:09:56" (1/3) ... [2025-03-08 07:10:11,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc4d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:11, skipping insertion in model container [2025-03-08 07:10:11,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:09:57" (2/3) ... [2025-03-08 07:10:11,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc4d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:11, skipping insertion in model container [2025-03-08 07:10:11,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:11" (3/3) ... [2025-03-08 07:10:11,027 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_4.i [2025-03-08 07:10:11,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:10:11,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_4+newton_2_4.i that has 4 procedures, 42 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 07:10:11,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:10:11,079 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;@1089e98f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:10:11,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:10:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 07:10:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 07:10:11,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:11,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:11,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:11,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1151646490, now seen corresponding path program 1 times [2025-03-08 07:10:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:10:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33716973] [2025-03-08 07:10:11,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:11,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:11,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:10:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 07:10:11,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 07:10:11,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:11,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 07:10:11,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:11,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:10:11,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:10:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33716973] [2025-03-08 07:10:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33716973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:10:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:10:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:10:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110403866] [2025-03-08 07:10:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:10:11,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:10:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:10:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:10:11,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:11,306 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:11,428 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2025-03-08 07:10:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:10:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 07:10:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:11,435 INFO L225 Difference]: With dead ends: 81 [2025-03-08 07:10:11,435 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 07:10:11,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:11,439 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:11,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 07:10:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-08 07:10:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:10:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-08 07:10:11,463 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2025-03-08 07:10:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-08 07:10:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-08 07:10:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 07:10:11,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:11,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:11,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:10:11,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:11,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2048670773, now seen corresponding path program 1 times [2025-03-08 07:10:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:10:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613697474] [2025-03-08 07:10:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:11,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:11,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:10:11,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 07:10:11,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 07:10:11,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:11,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:11,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 07:10:11,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:11,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:10:11,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:10:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613697474] [2025-03-08 07:10:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613697474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:10:11,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:10:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:10:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886486965] [2025-03-08 07:10:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:10:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:10:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:10:11,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:10:11,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:11,816 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:11,938 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-08 07:10:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:10:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 07:10:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:11,939 INFO L225 Difference]: With dead ends: 50 [2025-03-08 07:10:11,939 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 07:10:11,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:10:11,940 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:11,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:10:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 07:10:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 07:10:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:10:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 07:10:11,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 12 [2025-03-08 07:10:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 07:10:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 07:10:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 07:10:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:11,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:11,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:10:12,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:12,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 373208147, now seen corresponding path program 1 times [2025-03-08 07:10:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:10:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116602902] [2025-03-08 07:10:12,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:12,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:12,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:10:12,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 07:10:12,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 07:10:12,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:12,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:12,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 07:10:12,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:12,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:12,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:10:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116602902] [2025-03-08 07:10:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116602902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:12,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:10:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 07:10:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415503718] [2025-03-08 07:10:12,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:10:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:10:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:10:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:10:12,944 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:13,343 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-08 07:10:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:10:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 07:10:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:13,344 INFO L225 Difference]: With dead ends: 54 [2025-03-08 07:10:13,344 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 07:10:13,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:10:13,345 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:13,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:10:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 07:10:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-08 07:10:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:10:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-08 07:10:13,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 14 [2025-03-08 07:10:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-08 07:10:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-08 07:10:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 07:10:13,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:13,350 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:13,357 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-08 07:10:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:13,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1716297167, now seen corresponding path program 1 times [2025-03-08 07:10:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:10:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560338661] [2025-03-08 07:10:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:10:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:13,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:13,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:10:13,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 07:10:13,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 07:10:13,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:10:13,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:13,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 07:10:13,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:14,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:10:15,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:10:15,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560338661] [2025-03-08 07:10:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560338661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:15,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:10:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 07:10:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733880357] [2025-03-08 07:10:15,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:10:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:10:15,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:10:15,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:10:15,053 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:10:16,180 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-08 07:10:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:10:16,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 07:10:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:10:16,182 INFO L225 Difference]: With dead ends: 62 [2025-03-08 07:10:16,182 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 07:10:16,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:10:16,183 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:10:16,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:10:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 07:10:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-08 07:10:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 07:10:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-08 07:10:16,189 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2025-03-08 07:10:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:10:16,189 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-08 07:10:16,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-08 07:10:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:10:16,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:10:16,190 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:10:16,199 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-08 07:10:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:16,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:10:16,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:10:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1448466508, now seen corresponding path program 2 times [2025-03-08 07:10:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:10:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150740788] [2025-03-08 07:10:16,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:10:16,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:10:16,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:10:16,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:10:16,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:10:16,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 07:10:16,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:10:16,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:10:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:10:16,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:10:16,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:10:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:10:18,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:10:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:10:28,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:10:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150740788] [2025-03-08 07:10:28,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150740788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:10:28,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:10:28,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2025-03-08 07:10:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069787650] [2025-03-08 07:10:28,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:10:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 07:10:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:10:28,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 07:10:28,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:10:28,994 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:10:39,560 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 07:10:44,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:10:48,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:10:52,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:06,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:10,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:14,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:16,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:26,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 07:11:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:11:28,315 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-08 07:11:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 07:11:28,321 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 07:11:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:11:28,323 INFO L225 Difference]: With dead ends: 70 [2025-03-08 07:11:28,323 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 07:11:28,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=96, Invalid=503, Unknown=1, NotChecked=0, Total=600 [2025-03-08 07:11:28,324 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:11:28,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 439 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 36.4s Time] [2025-03-08 07:11:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 07:11:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-08 07:11:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 07:11:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-08 07:11:28,340 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 22 [2025-03-08 07:11:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:11:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-08 07:11:28,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:11:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-08 07:11:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 07:11:28,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:11:28,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:11:28,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:11:28,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:11:28,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:11:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:11:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1155762721, now seen corresponding path program 1 times [2025-03-08 07:11:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:11:28,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280384170] [2025-03-08 07:11:28,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:11:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 07:11:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 07:11:28,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 07:11:28,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 07:11:28,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.