./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:44:46,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:44:46,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:44:46,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:44:46,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:44:46,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:44:46,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:44:46,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:44:46,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:44:46,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:44:46,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:44:46,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:44:46,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:44:46,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:44:46,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:44:46,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:44:46,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:44:46,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:44:46,475 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2025-03-08 02:44:46,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:44:46,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:44:46,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:44:46,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:44:46,692 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:44:46,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2025-03-08 02:44:47,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76212bd09/25dadfdf41044d9f85f490f1d3504ac2/FLAG4674aaf28 [2025-03-08 02:44:48,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:44:48,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2025-03-08 02:44:48,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76212bd09/25dadfdf41044d9f85f490f1d3504ac2/FLAG4674aaf28 [2025-03-08 02:44:48,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76212bd09/25dadfdf41044d9f85f490f1d3504ac2 [2025-03-08 02:44:48,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:44:48,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:44:48,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:44:48,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:44:48,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:44:48,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab977d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48, skipping insertion in model container [2025-03-08 02:44:48,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:44:48,497 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/filter1.c.v+lhb-reducer.c[1355,1368] [2025-03-08 02:44:48,506 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/filter1.c.v+lhb-reducer.c[2394,2407] [2025-03-08 02:44:48,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:44:48,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:44:48,525 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/filter1.c.v+lhb-reducer.c[1355,1368] [2025-03-08 02:44:48,527 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/filter1.c.v+lhb-reducer.c[2394,2407] [2025-03-08 02:44:48,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:44:48,537 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:44:48,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48 WrapperNode [2025-03-08 02:44:48,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:44:48,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:44:48,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:44:48,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:44:48,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,555 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2025-03-08 02:44:48,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:44:48,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:44:48,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:44:48,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:44:48,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,567 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-08 02:44:48,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:44:48,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:44:48,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:44:48,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:44:48,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (1/1) ... [2025-03-08 02:44:48,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:44:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:44:48,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:44:48,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:44:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:44:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:44:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:44:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:44:48,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:44:48,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:44:48,768 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-08 02:44:48,778 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 02:44:48,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:44:48,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:44:48,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:44:48,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:44:48 BoogieIcfgContainer [2025-03-08 02:44:48,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:44:48,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:44:48,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:44:48,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:44:48,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:44:48" (1/3) ... [2025-03-08 02:44:48,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d99fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:44:48, skipping insertion in model container [2025-03-08 02:44:48,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:48" (2/3) ... [2025-03-08 02:44:48,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d99fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:44:48, skipping insertion in model container [2025-03-08 02:44:48,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:44:48" (3/3) ... [2025-03-08 02:44:48,791 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2025-03-08 02:44:48,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:44:48,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.v+lhb-reducer.c that has 1 procedures, 33 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 02:44:48,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:44:48,847 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;@252b61dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:44:48,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 02:44:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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-08 02:44:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:44:48,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:44:48,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:44:48,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:44:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:44:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 822159508, now seen corresponding path program 1 times [2025-03-08 02:44:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:44:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797515796] [2025-03-08 02:44:48,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:44:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:44:48,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:44:48,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:44:48,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:44:48,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:44:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:44:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:44:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797515796] [2025-03-08 02:44:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797515796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:44:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:44:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:44:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141038462] [2025-03-08 02:44:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:44:49,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:44:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:44:49,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:44:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:44:49,061 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-08 02:44:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:44:49,112 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2025-03-08 02:44:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:44:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-08 02:44:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:44:49,117 INFO L225 Difference]: With dead ends: 40 [2025-03-08 02:44:49,117 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 02:44:49,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:44:49,121 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:44:49,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:44:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 02:44:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 02:44:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-08 02:44:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 02:44:49,138 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-03-08 02:44:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:44:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 02:44:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-08 02:44:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 02:44:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:44:49,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:44:49,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:44:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:44:49,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:44:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:44:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 823142611, now seen corresponding path program 1 times [2025-03-08 02:44:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:44:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805594071] [2025-03-08 02:44:49,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:44:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:44:49,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:44:49,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:44:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:44:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:44:49,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 02:44:49,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:44:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:44:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:44:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:44:49,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 02:44:49,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 02:44:49,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 02:44:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 02:44:49,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:44:49,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 02:44:49,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:44:49,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:44:49 BoogieIcfgContainer [2025-03-08 02:44:49,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:44:49,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:44:49,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:44:49,185 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:44:49,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:44:48" (3/4) ... [2025-03-08 02:44:49,187 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 02:44:49,187 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:44:49,188 INFO L158 Benchmark]: Toolchain (without parser) took 820.04ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 50.6MB in the end (delta: 53.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 02:44:49,188 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:44:49,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.75ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:44:49,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.81ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:44:49,189 INFO L158 Benchmark]: Boogie Preprocessor took 16.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:44:49,189 INFO L158 Benchmark]: IcfgBuilder took 211.77ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 76.8MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:44:49,189 INFO L158 Benchmark]: TraceAbstraction took 398.97ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 50.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:44:49,189 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:44:49,190 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.75ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.81ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 211.77ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 76.8MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 398.97ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 50.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 142.6MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: 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 someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 32, overapproximation of to_real at line 41, overapproximation of to_real at line 23. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 48 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 42 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 02:44:49,201 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/filter1.c.v+lhb-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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:44:50,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:44:51,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 02:44:51,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:44:51,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:44:51,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:44:51,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:44:51,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:44:51,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:44:51,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:44:51,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:44:51,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:44:51,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:44:51,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:44:51,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:44:51,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:44:51,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:44:51,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:44:51,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:44:51,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:44:51,072 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2025-03-08 02:44:51,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:44:51,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:44:51,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:44:51,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:44:51,318 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:44:51,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2025-03-08 02:44:52,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e74e0c9/024e5839625e4fb4a8f5ab7ebed352a8/FLAG09cc4c375 [2025-03-08 02:44:52,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:44:52,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2025-03-08 02:44:52,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e74e0c9/024e5839625e4fb4a8f5ab7ebed352a8/FLAG09cc4c375 [2025-03-08 02:44:53,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e74e0c9/024e5839625e4fb4a8f5ab7ebed352a8 [2025-03-08 02:44:53,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:44:53,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:44:53,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:44:53,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:44:53,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:44:53,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bedb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53, skipping insertion in model container [2025-03-08 02:44:53,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:44:53,179 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/filter1.c.v+lhb-reducer.c[1355,1368] [2025-03-08 02:44:53,186 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/filter1.c.v+lhb-reducer.c[2394,2407] [2025-03-08 02:44:53,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:44:53,207 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:44:53,223 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/filter1.c.v+lhb-reducer.c[1355,1368] [2025-03-08 02:44:53,226 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/filter1.c.v+lhb-reducer.c[2394,2407] [2025-03-08 02:44:53,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:44:53,244 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:44:53,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53 WrapperNode [2025-03-08 02:44:53,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:44:53,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:44:53,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:44:53,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:44:53,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,268 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2025-03-08 02:44:53,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:44:53,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:44:53,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:44:53,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:44:53,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,285 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-08 02:44:53,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:44:53,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:44:53,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:44:53,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:44:53,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (1/1) ... [2025-03-08 02:44:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:44:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:44:53,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:44:53,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:44:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:44:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 02:44:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:44:53,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:44:53,393 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:44:53,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:45:01,793 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-08 02:45:01,806 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 02:45:01,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:45:01,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:45:01,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:45:01,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:45:01 BoogieIcfgContainer [2025-03-08 02:45:01,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:45:01,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:45:01,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:45:01,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:45:01,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:44:53" (1/3) ... [2025-03-08 02:45:01,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1ec50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:45:01, skipping insertion in model container [2025-03-08 02:45:01,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:44:53" (2/3) ... [2025-03-08 02:45:01,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1ec50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:45:01, skipping insertion in model container [2025-03-08 02:45:01,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:45:01" (3/3) ... [2025-03-08 02:45:01,820 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2025-03-08 02:45:01,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:45:01,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.v+lhb-reducer.c that has 1 procedures, 33 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 02:45:01,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:45:01,872 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;@63e8c294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:45:01,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 02:45:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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-08 02:45:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:45:01,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:45:01,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:45:01,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:45:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:45:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 822159508, now seen corresponding path program 1 times [2025-03-08 02:45:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:45:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560873092] [2025-03-08 02:45:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:45:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:45:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:45:01,891 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-08 02:45:01,893 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-08 02:45:01,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:45:01,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:45:01,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:45:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:45:01,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:45:01,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:45:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:45:02,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:45:02,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:45:02,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560873092] [2025-03-08 02:45:02,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560873092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:45:02,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:45:02,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:45:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721803735] [2025-03-08 02:45:02,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:45:02,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:45:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:45:02,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:45:02,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:45:02,078 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-08 02:45:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:45:02,178 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2025-03-08 02:45:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:45:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-08 02:45:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:45:02,183 INFO L225 Difference]: With dead ends: 40 [2025-03-08 02:45:02,183 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 02:45:02,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:45:02,187 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:45:02,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 02:45:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 02:45:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 02:45:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-08 02:45:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 02:45:02,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-03-08 02:45:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:45:02,209 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 02:45:02,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-08 02:45:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 02:45:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:45:02,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:45:02,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:45:02,216 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-08 02:45:02,413 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-08 02:45:02,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:45:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:45:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 823142611, now seen corresponding path program 1 times [2025-03-08 02:45:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:45:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145894993] [2025-03-08 02:45:02,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:45:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:45:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:45:02,416 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-08 02:45:02,417 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-08 02:45:02,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:45:02,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:45:02,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:45:02,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:45:02,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:45:02,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:45:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:45:02,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:45:02,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:45:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145894993] [2025-03-08 02:45:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145894993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:45:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:45:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:45:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964689189] [2025-03-08 02:45:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:45:02,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:45:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:45:02,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:45:02,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:45:02,505 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 02:45:03,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:45:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:45:04,874 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-03-08 02:45:04,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:45:04,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-08 02:45:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:45:04,875 INFO L225 Difference]: With dead ends: 71 [2025-03-08 02:45:04,875 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 02:45:04,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:45:04,876 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:45:04,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 02:45:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 02:45:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2025-03-08 02:45:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 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-08 02:45:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 02:45:04,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2025-03-08 02:45:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:45:04,884 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 02:45:04,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-08 02:45:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 02:45:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:45:04,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:45:04,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:45:04,888 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 (3)] Ended with exit code 0 [2025-03-08 02:45:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 02:45:05,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:45:05,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:45:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1696817323, now seen corresponding path program 1 times [2025-03-08 02:45:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:45:05,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076461776] [2025-03-08 02:45:05,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:45:05,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:45:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:45:05,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:45:05,090 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 (4)] Waiting until timeout for monitored process [2025-03-08 02:45:05,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:45:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:45:05,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:45:05,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:45:05,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:45:05,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:45:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:45:06,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:45:06,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:45:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076461776] [2025-03-08 02:45:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076461776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:45:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:45:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:45:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749670837] [2025-03-08 02:45:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:45:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:45:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:45:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:45:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:45:06,411 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 02:45:12,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:45:16,587 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 [0] [2025-03-08 02:45:20,591 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 [0] [2025-03-08 02:45:24,596 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 [0] [2025-03-08 02:45:28,604 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 [0] [2025-03-08 02:45:33,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:45:37,144 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-08 02:45:40,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:45:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:45:40,247 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2025-03-08 02:45:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 02:45:40,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-03-08 02:45:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:45:40,277 INFO L225 Difference]: With dead ends: 67 [2025-03-08 02:45:40,277 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 02:45:40,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:45:40,278 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:45:40,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 46 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 33.8s Time] [2025-03-08 02:45:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 02:45:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2025-03-08 02:45:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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-08 02:45:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-08 02:45:40,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2025-03-08 02:45:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:45:40,282 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-08 02:45:40,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 02:45:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-08 02:45:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:45:40,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:45:40,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:45:40,293 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 (4)] Ended with exit code 0 [2025-03-08 02:45:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-08 02:45:40,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:45:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:45:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1367897377, now seen corresponding path program 1 times [2025-03-08 02:45:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:45:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107982265] [2025-03-08 02:45:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:45:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:45:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:45:40,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:45:40,486 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 (5)] Waiting until timeout for monitored process [2025-03-08 02:45:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:45:40,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:45:40,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:45:40,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:45:40,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:45:40,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:45:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:45:40,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:45:40,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:45:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107982265] [2025-03-08 02:45:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107982265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:45:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:45:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:45:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220525094] [2025-03-08 02:45:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:45:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:45:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:45:40,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:45:40,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:45:40,612 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-08 02:45:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:45:40,724 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-08 02:45:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:45:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-03-08 02:45:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:45:40,725 INFO L225 Difference]: With dead ends: 34 [2025-03-08 02:45:40,725 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 02:45:40,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:45:40,725 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:45:40,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 02:45:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 02:45:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 02:45:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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-08 02:45:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-08 02:45:40,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 24 [2025-03-08 02:45:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:45:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-08 02:45:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-08 02:45:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-08 02:45:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:45:40,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:45:40,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:45:40,735 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 (5)] Ended with exit code 0 [2025-03-08 02:45:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 02:45:40,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:45:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:45:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 408093088, now seen corresponding path program 1 times [2025-03-08 02:45:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:45:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014401934] [2025-03-08 02:45:40,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:45:40,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:45:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:45:40,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:45:40,936 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 (6)] Waiting until timeout for monitored process [2025-03-08 02:45:40,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:45:41,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:45:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:45:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:45:41,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 02:45:41,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:46:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:46:00,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:46:00,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:46:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014401934] [2025-03-08 02:46:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014401934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:46:00,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:46:00,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 02:46:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045230903] [2025-03-08 02:46:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:46:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:46:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:46:00,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:46:00,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=50, Unknown=2, NotChecked=0, Total=90 [2025-03-08 02:46:00,009 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-08 02:46:01,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:15,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:21,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:22,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:26,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:29,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:30,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 02:46:33,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]