./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:51:52,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:51:52,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:51:52,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:51:52,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:51:52,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:51:52,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:51:52,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:51:52,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:51:52,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:51:52,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:51:52,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:51:52,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:51:52,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:51:52,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:51:52,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:51:52,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:51:52,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:51:52,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:51:52,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:51:52,678 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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2025-03-16 15:51:52,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:51:52,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:51:52,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:51:52,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:51:52,888 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:51:52,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:51:53,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da39e37a7/93f9ba269af140c395031d98151f35e0/FLAGdbfe31cbe [2025-03-16 15:51:54,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:51:54,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:51:54,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da39e37a7/93f9ba269af140c395031d98151f35e0/FLAGdbfe31cbe [2025-03-16 15:51:54,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da39e37a7/93f9ba269af140c395031d98151f35e0 [2025-03-16 15:51:54,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:51:54,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:51:54,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:51:54,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:51:54,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:51:54,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdc3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54, skipping insertion in model container [2025-03-16 15:51:54,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:51:54,700 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2025-03-16 15:51:54,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:51:54,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:51:54,722 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2025-03-16 15:51:54,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:51:54,734 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:51:54,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54 WrapperNode [2025-03-16 15:51:54,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:51:54,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:51:54,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:51:54,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:51:54,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,760 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2025-03-16 15:51:54,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:51:54,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:51:54,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:51:54,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:51:54,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:51:54,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:51:54,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:51:54,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:51:54,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:51:54,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (1/1) ... [2025-03-16 15:51:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:51:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:54,814 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-16 15:51:54,816 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-16 15:51:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:51:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:51:54,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:51:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:51:54,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:51:54,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:51:54,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-16 15:51:54,933 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 15:51:54,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:51:54,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:51:54,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:51:54,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:54 BoogieIcfgContainer [2025-03-16 15:51:54,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:51:54,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:51:54,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:51:54,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:51:54,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:51:54" (1/3) ... [2025-03-16 15:51:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6bf9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:51:54, skipping insertion in model container [2025-03-16 15:51:54,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:51:54" (2/3) ... [2025-03-16 15:51:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6bf9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:51:54, skipping insertion in model container [2025-03-16 15:51:54,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:54" (3/3) ... [2025-03-16 15:51:54,945 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:51:54,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:51:54,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c.p+cfa-reducer.c that has 1 procedures, 12 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 15:51:54,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:51:55,007 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;@291cbe44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:51:55,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:51:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:51:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:55,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:55,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -505797587, now seen corresponding path program 1 times [2025-03-16 15:51:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319334656] [2025-03-16 15:51:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:55,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:51:55,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:51:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,128 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-16 15:51:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319334656] [2025-03-16 15:51:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319334656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:51:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375058303] [2025-03-16 15:51:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:55,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:51:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:51:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:51:55,149 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:55,160 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-03-16 15:51:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:51:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 15:51:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:55,164 INFO L225 Difference]: With dead ends: 23 [2025-03-16 15:51:55,164 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 15:51:55,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 15:51:55,167 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:55,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 15:51:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-16 15:51:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-16 15:51:55,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2025-03-16 15:51:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:55,183 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-16 15:51:55,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-03-16 15:51:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 15:51:55,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:55,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:51:55,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:55,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484473, now seen corresponding path program 1 times [2025-03-16 15:51:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267797069] [2025-03-16 15:51:55,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:55,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 15:51:55,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 15:51:55,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:55,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,234 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-16 15:51:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267797069] [2025-03-16 15:51:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267797069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:51:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551425872] [2025-03-16 15:51:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:55,236 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-16 15:51:55,237 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-16 15:51:55,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 15:51:55,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 15:51:55,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:55,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:51:55,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:55,299 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-16 15:51:55,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:51:55,323 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-16 15:51:55,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551425872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:51:55,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:51:55,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-16 15:51:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727558265] [2025-03-16 15:51:55,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:51:55,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:51:55,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:55,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:51:55,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:51:55,325 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:55,338 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-03-16 15:51:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:51:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 15:51:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:55,340 INFO L225 Difference]: With dead ends: 20 [2025-03-16 15:51:55,340 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 15:51:55,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:51:55,341 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:55,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 15:51:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 15:51:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-16 15:51:55,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2025-03-16 15:51:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:55,345 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-16 15:51:55,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-16 15:51:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 15:51:55,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:55,346 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:55,353 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-16 15:51:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:55,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:55,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1405814099, now seen corresponding path program 2 times [2025-03-16 15:51:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:55,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403521803] [2025-03-16 15:51:55,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:51:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:55,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-16 15:51:55,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-16 15:51:55,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 15:51:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 15:51:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403521803] [2025-03-16 15:51:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403521803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:51:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716203301] [2025-03-16 15:51:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:51:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:51:55,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:51:55,610 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:55,622 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-16 15:51:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:51:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-16 15:51:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:55,623 INFO L225 Difference]: With dead ends: 17 [2025-03-16 15:51:55,623 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 15:51:55,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:51:55,624 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:55,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 15:51:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 15:51:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-16 15:51:55,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2025-03-16 15:51:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:55,627 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-16 15:51:55,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-16 15:51:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 15:51:55,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:55,628 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:51:55,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1404830996, now seen corresponding path program 1 times [2025-03-16 15:51:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145929142] [2025-03-16 15:51:55,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 15:51:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 15:51:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145929142] [2025-03-16 15:51:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145929142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:51:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068285592] [2025-03-16 15:51:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:55,714 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-16 15:51:55,716 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-16 15:51:55,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 15:51:55,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 15:51:55,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:55,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:55,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:51:55,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:55,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:51:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068285592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:51:55,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:51:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-16 15:51:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221853923] [2025-03-16 15:51:55,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:51:55,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 15:51:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:55,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 15:51:55,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 15:51:55,827 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:55,842 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-03-16 15:51:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 15:51:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-16 15:51:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:55,843 INFO L225 Difference]: With dead ends: 26 [2025-03-16 15:51:55,843 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 15:51:55,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 15:51:55,844 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:55,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 15:51:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 15:51:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-16 15:51:55,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2025-03-16 15:51:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-16 15:51:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-16 15:51:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 15:51:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:55,848 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:55,855 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-16 15:51:56,052 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,SelfDestructingSolverStorable3 [2025-03-16 15:51:56,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:56,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash 555328684, now seen corresponding path program 2 times [2025-03-16 15:51:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683512508] [2025-03-16 15:51:56,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:51:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:56,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-16 15:51:56,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:51:56,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:51:56,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683512508] [2025-03-16 15:51:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683512508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:51:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448022094] [2025-03-16 15:51:56,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:51:56,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:56,242 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-16 15:51:56,244 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-16 15:51:56,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-16 15:51:56,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:51:56,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:51:56,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:56,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 15:51:56,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:56,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:51:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448022094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:51:56,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:51:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-16 15:51:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705809135] [2025-03-16 15:51:56,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:51:56,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 15:51:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:56,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 15:51:56,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 15:51:56,509 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:56,530 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-16 15:51:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 15:51:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 15:51:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:56,530 INFO L225 Difference]: With dead ends: 38 [2025-03-16 15:51:56,530 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 15:51:56,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 15:51:56,531 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:56,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 15:51:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 15:51:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-03-16 15:51:56,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 17 [2025-03-16 15:51:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:56,534 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-03-16 15:51:56,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-03-16 15:51:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:51:56,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:56,534 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:56,540 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-16 15:51:56,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:56,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -891418580, now seen corresponding path program 3 times [2025-03-16 15:51:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834917139] [2025-03-16 15:51:56,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 15:51:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:56,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 12 equivalence classes. [2025-03-16 15:51:56,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:51:56,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 15:51:56,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834917139] [2025-03-16 15:51:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834917139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:51:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286338630] [2025-03-16 15:51:57,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 15:51:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:57,175 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-16 15:51:57,176 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-16 15:51:57,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 12 equivalence classes. [2025-03-16 15:51:57,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:51:57,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 15:51:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:57,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 15:51:57,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:57,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:51:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286338630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:51:57,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:51:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-16 15:51:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545175465] [2025-03-16 15:51:57,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:51:57,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 15:51:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:51:57,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 15:51:57,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 15:51:57,922 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:57,962 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2025-03-16 15:51:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-16 15:51:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-16 15:51:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:57,963 INFO L225 Difference]: With dead ends: 62 [2025-03-16 15:51:57,963 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 15:51:57,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 15:51:57,964 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:57,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 15:51:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 15:51:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-03-16 15:51:57,970 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 29 [2025-03-16 15:51:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-03-16 15:51:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-03-16 15:51:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 15:51:57,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:57,972 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:57,979 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-16 15:51:58,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:58,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1062932268, now seen corresponding path program 4 times [2025-03-16 15:51:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:51:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310540138] [2025-03-16 15:51:58,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 15:51:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:51:58,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-16 15:51:58,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 15:51:58,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 15:51:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:51:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310540138] [2025-03-16 15:51:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310540138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:51:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352030654] [2025-03-16 15:51:59,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 15:51:59,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:51:59,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:51:59,541 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-16 15:51:59,543 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-16 15:51:59,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-16 15:51:59,623 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 15:51:59,623 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 15:51:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:59,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 15:51:59,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:59,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:52:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:52:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352030654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:52:01,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:52:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 98 [2025-03-16 15:52:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535668933] [2025-03-16 15:52:01,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:52:01,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2025-03-16 15:52:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:52:01,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2025-03-16 15:52:01,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4660, Invalid=5042, Unknown=0, NotChecked=0, Total=9702 [2025-03-16 15:52:01,725 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 99 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:52:01,816 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2025-03-16 15:52:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-16 15:52:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 15:52:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:52:01,816 INFO L225 Difference]: With dead ends: 110 [2025-03-16 15:52:01,817 INFO L226 Difference]: Without dead ends: 103 [2025-03-16 15:52:01,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4660, Invalid=5042, Unknown=0, NotChecked=0, Total=9702 [2025-03-16 15:52:01,819 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:52:01,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:52:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-16 15:52:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-16 15:52:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2025-03-16 15:52:01,825 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 53 [2025-03-16 15:52:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:52:01,825 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2025-03-16 15:52:01,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2025-03-16 15:52:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 15:52:01,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:52:01,830 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:52:01,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:52:02,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:52:02,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:52:02,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:52:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash 145104172, now seen corresponding path program 5 times [2025-03-16 15:52:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:52:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484992735] [2025-03-16 15:52:02,031 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 15:52:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:52:02,068 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 101 statements into 48 equivalence classes. [2025-03-16 15:52:02,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 15:52:02,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-16 15:52:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:52:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:52:05,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:52:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484992735] [2025-03-16 15:52:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484992735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:52:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851496278] [2025-03-16 15:52:05,327 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 15:52:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:52:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:52:05,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:52:05,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:52:05,398 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 101 statements into 48 equivalence classes. [2025-03-16 15:52:05,468 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 15:52:05,468 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-16 15:52:05,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:52:05,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-16 15:52:05,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:52:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:52:05,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:52:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:52:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851496278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:52:08,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:52:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 101 [2025-03-16 15:52:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047630867] [2025-03-16 15:52:08,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:52:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-16 15:52:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:52:08,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-16 15:52:08,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 15:52:08,402 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:52:08,488 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2025-03-16 15:52:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-16 15:52:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 15:52:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:52:08,490 INFO L225 Difference]: With dead ends: 116 [2025-03-16 15:52:08,490 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 15:52:08,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 106 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 15:52:08,492 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:52:08,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:52:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 15:52:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-16 15:52:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2025-03-16 15:52:08,501 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 101 [2025-03-16 15:52:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:52:08,502 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2025-03-16 15:52:08,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2025-03-16 15:52:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 15:52:08,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:52:08,504 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:52:08,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:52:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:52:08,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:52:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:52:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash -110553364, now seen corresponding path program 6 times [2025-03-16 15:52:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:52:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313837138] [2025-03-16 15:52:08,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 15:52:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:52:08,723 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 107 statements into 51 equivalence classes. [2025-03-16 15:52:08,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 15:52:08,763 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-03-16 15:52:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:52:08,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 15:52:08,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 15:52:08,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 15:52:08,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:52:08,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:52:08,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 15:52:08,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 15:52:08,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:52:08,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:52:08,832 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2025-03-16 15:52:08,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:52:08,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:52:08 BoogieIcfgContainer [2025-03-16 15:52:08,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:52:08,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:52:08,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:52:08,896 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:52:08,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:54" (3/4) ... [2025-03-16 15:52:08,898 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 15:52:08,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:52:08,901 INFO L158 Benchmark]: Toolchain (without parser) took 14318.22ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.3MB in the beginning and 339.2MB in the end (delta: -226.9MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-03-16 15:52:08,901 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:52:08,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.23ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:52:08,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.13ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.6MB in the end (delta: 993.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:52:08,902 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:52:08,902 INFO L158 Benchmark]: IcfgBuilder took 151.75ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 88.4MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:52:08,902 INFO L158 Benchmark]: TraceAbstraction took 13955.23ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.9MB in the beginning and 339.3MB in the end (delta: -251.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2025-03-16 15:52:08,903 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 427.8MB. Free memory was 339.3MB in the beginning and 339.2MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:52:08,904 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.23ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.13ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.6MB in the end (delta: 993.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 151.75ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 88.4MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13955.23ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.9MB in the beginning and 339.3MB in the end (delta: -251.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 427.8MB. Free memory was 339.3MB in the beginning and 339.2MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 41]: 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 someBinaryArithmeticDOUBLEoperation at line 19, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L1] int __return_main; [L9] double main__x0; [L10] double main__x1; [L11] double main__x2; [L12] int main__i; [L13] main__x0 = 5.5 [L14] main__x1 = 5.545454545454546 [L15] main__i = 0 VAL [__return_main=0, main__i=0, main__x1=2772727272727273/500000000000000] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x1=153] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x1=143] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x1=117] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x1=115] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x1=110] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x1=168] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x1=198] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x1=180] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x1=155] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x1=118] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x1=135] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x1=145] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x1=162] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x1=182] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x1=109] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x1=158] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x1=157] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x1=138] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x1=136] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x1=156] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x1=140] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x1=124] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x1=128] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x1=196] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x1=144] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x1=119] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x1=108] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x1=111] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x1=195] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x1=176] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x1=146] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x1=187] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x1=172] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x1=169] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x1=139] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x1=120] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x1=185] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x1=192] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x1=197] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x1=160] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x1=116] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x1=179] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x1=163] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x1=148] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x1=199] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x1=106] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x1=161] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x1=189] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x1=125] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x1=188] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x1=123] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x1=130] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x1=181] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x1=121] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x1=166] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x1=191] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x1=173] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x1=151] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x1=152] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x1=154] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x1=171] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x1=174] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x1=184] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x1=127] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x1=190] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x1=112] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x1=193] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x1=126] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x1=183] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x1=107] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x1=194] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x1=200] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x1=170] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x1=142] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x1=147] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x1=149] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x1=133] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x1=201] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x1=202] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x1=186] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x1=175] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x1=167] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x1=134] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x1=164] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x1=165] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x1=178] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x1=131] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x1=114] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x1=113] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x1=122] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x1=132] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x1=177] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x1=141] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x1=105] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x1=150] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x1=204] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x1=159] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x1=129] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x1=137] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x1=203] [L17] COND FALSE !(main__i < 100) [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__x1=203] [L28] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__x1=203] [L53] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__x1=203] [L35] int __tmp_1; [L36] __tmp_1 = main____CPAchecker_TMP_0 [L37] int __VERIFIER_assert__cond; [L38] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__x1=203] [L39] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__x1=203] [L41] reach_error() VAL [__return_main=0, main__x1=203] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 15 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 9, TraceHistogramMax: 100, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 334 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 78 mSDtfsCounter, 334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 252 SyntacticMatches, 90 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4731 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 563 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 185 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 1765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10/17605 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-16 15:52:08,924 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:52:10,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:52:10,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 15:52:10,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:52:10,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:52:10,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:52:10,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:52:10,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:52:10,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:52:10,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:52:10,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:52:10,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:52:10,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:52:10,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:52:10,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:52:10,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:52:10,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 15:52:10,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:52:10,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:52:10,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:52:10,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:52:10,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:52:10,847 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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2025-03-16 15:52:11,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:52:11,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:52:11,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:52:11,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:52:11,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:52:11,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:52:12,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ab46111/5170ac5695994b3e81077ba0a7009bb0/FLAGbc3fbf3a5 [2025-03-16 15:52:12,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:52:12,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:52:12,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ab46111/5170ac5695994b3e81077ba0a7009bb0/FLAGbc3fbf3a5 [2025-03-16 15:52:12,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ab46111/5170ac5695994b3e81077ba0a7009bb0 [2025-03-16 15:52:12,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:52:12,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:52:12,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:52:12,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:52:12,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:52:12,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650946e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12, skipping insertion in model container [2025-03-16 15:52:12,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:52:12,595 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2025-03-16 15:52:12,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:52:12,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:52:12,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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2025-03-16 15:52:12,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:52:12,632 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:52:12,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12 WrapperNode [2025-03-16 15:52:12,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:52:12,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:52:12,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:52:12,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:52:12,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,655 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2025-03-16 15:52:12,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:52:12,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:52:12,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:52:12,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:52:12,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:52:12,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:52:12,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:52:12,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:52:12,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:52:12,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (1/1) ... [2025-03-16 15:52:12,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:52:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:52:12,710 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-16 15:52:12,715 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-16 15:52:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:52:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:52:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:52:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 15:52:12,776 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:52:12,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:52:17,481 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-16 15:52:17,489 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 15:52:17,489 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:52:17,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:52:17,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:52:17,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:52:17 BoogieIcfgContainer [2025-03-16 15:52:17,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:52:17,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:52:17,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:52:17,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:52:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:52:12" (1/3) ... [2025-03-16 15:52:17,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b42476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:52:17, skipping insertion in model container [2025-03-16 15:52:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:52:12" (2/3) ... [2025-03-16 15:52:17,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b42476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:52:17, skipping insertion in model container [2025-03-16 15:52:17,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:52:17" (3/3) ... [2025-03-16 15:52:17,501 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2025-03-16 15:52:17,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:52:17,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c.p+cfa-reducer.c that has 1 procedures, 12 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 15:52:17,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:52:17,557 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;@56da1ab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:52:17,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:52:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 15:52:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:52:17,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:52:17,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:52:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:52:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash -505797587, now seen corresponding path program 1 times [2025-03-16 15:52:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:52:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948131718] [2025-03-16 15:52:17,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:52:17,580 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-16 15:52:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:52:17,584 INFO L229 MonitoredProcess]: Starting monitored process 2 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-16 15:52:17,585 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 (2)] Waiting until timeout for monitored process [2025-03-16 15:52:17,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 15:52:17,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 15:52:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:52:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:52:17,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:52:17,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:52:17,789 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-16 15:52:17,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:52:17,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:52:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948131718] [2025-03-16 15:52:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948131718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:52:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:52:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:52:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834447430] [2025-03-16 15:52:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:52:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:52:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:52:17,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:52:17,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:52:17,806 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:22,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:26,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:30,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:52:30,633 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-03-16 15:52:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:52:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 15:52:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:52:30,640 INFO L225 Difference]: With dead ends: 23 [2025-03-16 15:52:30,640 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 15:52:30,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:52:30,643 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:52:30,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2025-03-16 15:52:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 15:52:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-16 15:52:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-16 15:52:30,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2025-03-16 15:52:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:52:30,662 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-16 15:52:30,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-03-16 15:52:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 15:52:30,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:52:30,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:52:30,667 INFO L552 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 (2)] Ended with exit code 0 [2025-03-16 15:52:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /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 [2025-03-16 15:52:30,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:52:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:52:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484473, now seen corresponding path program 1 times [2025-03-16 15:52:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:52:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579309405] [2025-03-16 15:52:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:52:30,867 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-16 15:52:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:52:30,869 INFO L229 MonitoredProcess]: Starting monitored process 3 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-16 15:52:30,870 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 (3)] Waiting until timeout for monitored process [2025-03-16 15:52:30,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 15:52:32,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 15:52:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:52:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:52:32,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:52:32,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:52:32,439 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-16 15:52:32,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:52:32,838 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-16 15:52:32,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:52:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579309405] [2025-03-16 15:52:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579309405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:52:32,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:52:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-16 15:52:32,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002023749] [2025-03-16 15:52:32,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 15:52:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:52:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:52:32,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:52:32,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:52:32,840 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:52:37,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:41,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:45,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:49,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:53,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:52:58,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:02,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:06,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:10,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:14,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:18,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:22,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:26,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:30,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 15:53:34,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []