./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:34:51,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:34:51,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:34:51,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:34:51,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:34:51,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:34:51,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:34:51,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:34:51,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:34:51,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:34:51,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:34:51,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:34:51,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:34:51,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:34:51,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:34:51,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:34:51,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:34:51,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:34:51,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:34:51,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:34:51,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:34:51,658 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2025-03-03 11:34:51,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:34:51,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:34:51,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:34:51,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:34:51,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:34:51,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2025-03-03 11:34:53,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8645b3024/5e27ed2591c94e1f969e5d7fd842c3d5/FLAG23d15a111 [2025-03-03 11:34:53,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:34:53,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2025-03-03 11:34:53,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8645b3024/5e27ed2591c94e1f969e5d7fd842c3d5/FLAG23d15a111 [2025-03-03 11:34:53,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8645b3024/5e27ed2591c94e1f969e5d7fd842c3d5 [2025-03-03 11:34:53,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:34:53,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:34:53,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:34:53,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:34:53,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:34:53,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53, skipping insertion in model container [2025-03-03 11:34:53,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:34:53,374 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+nlh-reducer.c[1372,1385] [2025-03-03 11:34:53,380 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+nlh-reducer.c[2411,2424] [2025-03-03 11:34:53,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:34:53,398 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:34:53,412 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+nlh-reducer.c[1372,1385] [2025-03-03 11:34:53,415 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+nlh-reducer.c[2411,2424] [2025-03-03 11:34:53,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:34:53,432 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:34:53,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53 WrapperNode [2025-03-03 11:34:53,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:34:53,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:34:53,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:34:53,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:34:53,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,459 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2025-03-03 11:34:53,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:34:53,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:34:53,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:34:53,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:34:53,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,480 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-03 11:34:53,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:34:53,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:34:53,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:34:53,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:34:53,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (1/1) ... [2025-03-03 11:34:53,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:34:53,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:34:53,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:34:53,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:34:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:34:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:34:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:34:53,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:34:53,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:34:53,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:34:53,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: 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-03 11:34:53,718 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 11:34:53,718 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:34:53,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:34:53,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:34:53,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:53 BoogieIcfgContainer [2025-03-03 11:34:53,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:34:53,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:34:53,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:34:53,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:34:53,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:34:53" (1/3) ... [2025-03-03 11:34:53,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:53, skipping insertion in model container [2025-03-03 11:34:53,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:53" (2/3) ... [2025-03-03 11:34:53,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:34:53, skipping insertion in model container [2025-03-03 11:34:53,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:53" (3/3) ... [2025-03-03 11:34:53,731 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2025-03-03 11:34:53,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:34:53,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.v+nlh-reducer.c that has 1 procedures, 34 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 11:34:53,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:34:53,783 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;@1c27406f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:34:53,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:34:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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-03 11:34:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:34:53,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:34:53,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:34:53,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:34:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:34:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash -483182636, now seen corresponding path program 1 times [2025-03-03 11:34:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:34:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-03 11:34:53,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:34:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:34:53,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:34:53,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:34:53,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:34:53,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:34:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:34:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:34:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882727538] [2025-03-03 11:34:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882727538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:34:53,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:34:53,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:34:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958864501] [2025-03-03 11:34:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:34:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:34:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:34:54,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:34:54,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:34:54,008 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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-03 11:34:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:34:54,061 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-03 11:34:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:34:54,062 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-03 11:34:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:34:54,066 INFO L225 Difference]: With dead ends: 42 [2025-03-03 11:34:54,067 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 11:34:54,068 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-03 11:34:54,070 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 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-03 11:34:54,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:34:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 11:34:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 11:34:54,085 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-03 11:34:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-03 11:34:54,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-03-03 11:34:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:34:54,090 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-03 11:34:54,090 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-03 11:34:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-03 11:34:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:34:54,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:34:54,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:34:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:34:54,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:34:54,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:34:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash -482199533, now seen corresponding path program 1 times [2025-03-03 11:34:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:34:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174058690] [2025-03-03 11:34:54,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:34:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:34:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:34:54,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:34:54,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:34:54,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:34:54,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:34:54,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:34:54,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:34:54,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:34:54,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:34:54,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:34:54,132 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:34:54,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 11:34:54,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 11:34:54,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:34:54,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 11:34:54,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:34:54,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:34:54 BoogieIcfgContainer [2025-03-03 11:34:54,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:34:54,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:34:54,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:34:54,157 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:34:54,157 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:34:53" (3/4) ... [2025-03-03 11:34:54,159 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:34:54,159 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:34:54,160 INFO L158 Benchmark]: Toolchain (without parser) took 912.25ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 56.1MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 11:34:54,160 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:34:54,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.66ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 99.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:34:54,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.53ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:34:54,160 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:34:54,160 INFO L158 Benchmark]: IcfgBuilder took 231.86ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 83.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:34:54,161 INFO L158 Benchmark]: TraceAbstraction took 430.03ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 56.1MB in the end (delta: 26.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 11:34:54,161 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 142.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:34:54,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.66ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 99.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.53ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 231.86ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 83.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 430.03ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 56.1MB in the end (delta: 26.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 142.6MB. Free memory is still 56.1MB. 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: 59]: 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 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of to_real at line 24, overapproximation of to_real at line 42. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __tmp_112_0; [L17] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L20] double main__E0; [L21] double main__E1; [L22] double main__S; [L23] int main__i; [L24] main__E1 = 0 [L25] main__S = 0 [L26] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L27] COND TRUE main__i <= 1000000 [L29] main__E0 = __VERIFIER_nondet_double() [L30] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L31] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L33] COND TRUE main__E0 <= 1.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; [L39] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L40] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L42] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=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] [L44] main__E1 = main__E0 [L45] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_112_0=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] [L46] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_112_0=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] [L166] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=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] [L53] int __tmp_1; [L54] __tmp_1 = main____CPAchecker_TMP_2 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_112_0=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] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=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] [L59] reach_error() VAL [__return_134=0, __return_main=0, __tmp_112_0=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: 105]: 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, 34 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, 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, 150 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 43 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=34occurred 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-03 11:34:54,174 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+nlh-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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:34:55,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:34:56,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:34:56,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:34:56,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:34:56,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:34:56,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:34:56,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:34:56,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:34:56,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:34:56,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:34:56,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:34:56,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:34:56,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:34:56,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:34:56,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:34:56,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:34:56,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:34:56,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:34:56,041 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2025-03-03 11:34:56,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:34:56,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:34:56,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:34:56,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:34:56,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:34:56,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2025-03-03 11:34:57,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ac51892/61760fee12294c9fb5f243c39005f991/FLAG22b1655c1 [2025-03-03 11:34:57,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:34:57,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2025-03-03 11:34:57,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ac51892/61760fee12294c9fb5f243c39005f991/FLAG22b1655c1 [2025-03-03 11:34:57,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ac51892/61760fee12294c9fb5f243c39005f991 [2025-03-03 11:34:57,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:34:57,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:34:57,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:34:57,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:34:57,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:34:57,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f2a441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57, skipping insertion in model container [2025-03-03 11:34:57,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:34:57,756 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+nlh-reducer.c[1372,1385] [2025-03-03 11:34:57,764 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+nlh-reducer.c[2411,2424] [2025-03-03 11:34:57,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:34:57,783 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:34:57,793 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+nlh-reducer.c[1372,1385] [2025-03-03 11:34:57,798 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+nlh-reducer.c[2411,2424] [2025-03-03 11:34:57,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:34:57,817 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:34:57,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57 WrapperNode [2025-03-03 11:34:57,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:34:57,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:34:57,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:34:57,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:34:57,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,852 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2025-03-03 11:34:57,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:34:57,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:34:57,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:34:57,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:34:57,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,872 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-03 11:34:57,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:34:57,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:34:57,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:34:57,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:34:57,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (1/1) ... [2025-03-03 11:34:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:34:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:34:57,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:34:57,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:34:57,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:34:57,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:34:57,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:34:57,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:34:57,990 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:34:57,991 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:35:06,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: 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-03 11:35:06,408 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 11:35:06,408 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:35:06,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:35:06,418 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:35:06,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:06 BoogieIcfgContainer [2025-03-03 11:35:06,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:35:06,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:35:06,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:35:06,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:35:06,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:34:57" (1/3) ... [2025-03-03 11:35:06,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bc1bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:06, skipping insertion in model container [2025-03-03 11:35:06,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:34:57" (2/3) ... [2025-03-03 11:35:06,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bc1bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:06, skipping insertion in model container [2025-03-03 11:35:06,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:06" (3/3) ... [2025-03-03 11:35:06,425 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2025-03-03 11:35:06,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:35:06,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.v+nlh-reducer.c that has 1 procedures, 34 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 11:35:06,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:35:06,486 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;@dabfde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:35:06,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:35:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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-03 11:35:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:35:06,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:35:06,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:35:06,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:35:06,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:35:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash -483182636, now seen corresponding path program 1 times [2025-03-03 11:35:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:35:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196305057] [2025-03-03 11:35:06,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:35:06,504 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-03 11:35:06,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:35:06,506 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-03 11:35:06,507 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-03 11:35:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:35:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:35:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:35:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:35:06,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:35:06,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:35:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:35:06,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:35:06,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:35:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196305057] [2025-03-03 11:35:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196305057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:35:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:35:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:35:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803200585] [2025-03-03 11:35:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:35:06,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:35:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:35:06,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:35:06,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:35:06,680 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 states have internal predecessors, (49), 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-03 11:35:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:35:06,779 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-03-03 11:35:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:35:06,781 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-03 11:35:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:35:06,785 INFO L225 Difference]: With dead ends: 41 [2025-03-03 11:35:06,785 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 11:35:06,787 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-03 11:35:06,788 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 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-03 11:35:06,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:35:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 11:35:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 11:35:06,804 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-03 11:35:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-03 11:35:06,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2025-03-03 11:35:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:35:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-03 11:35:06,808 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-03 11:35:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-03 11:35:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:35:06,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:35:06,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:35:06,811 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-03 11:35:07,011 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-03 11:35:07,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:35:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:35:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -482199533, now seen corresponding path program 1 times [2025-03-03 11:35:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:35:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354744268] [2025-03-03 11:35:07,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:35:07,012 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-03 11:35:07,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:35:07,014 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-03 11:35:07,015 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-03 11:35:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:35:07,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:35:07,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:35:07,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:35:07,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:35:07,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:35:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:35:07,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:35:07,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:35:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354744268] [2025-03-03 11:35:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354744268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:35:07,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:35:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:35:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373934957] [2025-03-03 11:35:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:35:07,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:35:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:35:07,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:35:07,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:35:07,108 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-03 11:35:08,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:35:09,395 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-03-03 11:35:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:35:09,396 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-03 11:35:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:35:09,397 INFO L225 Difference]: With dead ends: 71 [2025-03-03 11:35:09,397 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 11:35:09,397 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-03 11:35:09,398 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:35:09,398 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.3s Time] [2025-03-03 11:35:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 11:35:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2025-03-03 11:35:09,400 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-03 11:35:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-03 11:35:09,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2025-03-03 11:35:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:35:09,401 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-03 11:35:09,401 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-03 11:35:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-03 11:35:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:35:09,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:35:09,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:35:09,404 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-03 11:35:09,601 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-03 11:35:09,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:35:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:35:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1292807829, now seen corresponding path program 1 times [2025-03-03 11:35:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:35:09,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197871396] [2025-03-03 11:35:09,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:35:09,603 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-03 11:35:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:35:09,604 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-03 11:35:09,605 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-03 11:35:09,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:35:09,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:35:09,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:35:09,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:35:09,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:35:09,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:35:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:35:10,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:35:10,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:35:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197871396] [2025-03-03 11:35:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197871396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:35:10,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:35:10,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:35:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414239644] [2025-03-03 11:35:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:35:10,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:35:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:35:10,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:35:10,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:35:10,746 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-03 11:35:16,954 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-03 11:35:20,958 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-03 11:35:24,961 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-03 11:35:28,965 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-03 11:35:32,970 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-03 11:35:37,527 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-03 11:35:41,532 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-03 11:35:45,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:49,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:53,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:35:53,543 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2025-03-03 11:35:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:35:53,577 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-03 11:35:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:35:53,578 INFO L225 Difference]: With dead ends: 67 [2025-03-03 11:35:53,578 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 11:35:53,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:35:53,579 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:35:53,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 53 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 42.8s Time] [2025-03-03 11:35:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 11:35:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2025-03-03 11:35:53,580 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-03 11:35:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-03 11:35:53,581 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2025-03-03 11:35:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:35:53,581 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-03 11:35:53,581 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-03 11:35:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-03 11:35:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 11:35:53,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:35:53,582 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-03 11:35:53,591 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-03 11:35:53,782 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-03 11:35:53,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:35:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:35:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2092717089, now seen corresponding path program 1 times [2025-03-03 11:35:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:35:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702556364] [2025-03-03 11:35:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:35:53,783 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-03 11:35:53,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:35:53,788 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-03 11:35:53,788 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-03 11:35:53,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 11:35:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 11:35:53,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:35:53,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:35:53,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:35:53,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:35:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:35:53,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:35:53,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:35:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702556364] [2025-03-03 11:35:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702556364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:35:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:35:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:35:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131906598] [2025-03-03 11:35:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:35:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:35:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:35:53,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:35:53,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:35:53,909 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-03 11:35:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:35:54,005 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-03 11:35:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:35:54,006 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-03 11:35:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:35:54,006 INFO L225 Difference]: With dead ends: 34 [2025-03-03 11:35:54,006 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 11:35:54,006 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-03 11:35:54,007 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-03 11:35:54,007 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-03 11:35:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 11:35:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 11:35:54,008 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-03 11:35:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-03 11:35:54,009 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 24 [2025-03-03 11:35:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:35:54,009 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-03 11:35:54,009 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-03 11:35:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-03 11:35:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 11:35:54,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:35:54,010 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-03 11:35:54,013 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-03 11:35:54,210 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-03 11:35:54,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:35:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:35:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -316726624, now seen corresponding path program 1 times [2025-03-03 11:35:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:35:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613614172] [2025-03-03 11:35:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:35:54,211 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-03 11:35:54,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:35:54,213 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-03 11:35:54,214 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-03 11:35:54,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 11:35:54,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 11:35:54,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:35:54,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:35:54,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 11:35:54,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:11,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:36:11,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613614172] [2025-03-03 11:36:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613614172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:11,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 11:36:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118100213] [2025-03-03 11:36:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:11,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 11:36:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:11,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 11:36:11,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=51, Unknown=1, NotChecked=0, Total=90 [2025-03-03 11:36:11,403 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-03 11:36:15,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:36:30,787 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-03 11:36:33,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:36:35,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:36:39,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]