./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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 -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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:07:47,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:07:48,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 23:07:48,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:07:48,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:07:48,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:07:48,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:07:48,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:07:48,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:07:48,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:07:48,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:07:48,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:07:48,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:07:48,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:07:48,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:07:48,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:07:48,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:07:48,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:07:48,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 23:07:48,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:07:48,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:07:48,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:07:48,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:07:48,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:07:48,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:07:48,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:07:48,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:07:48,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:07:48,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:07:48,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:07:48,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:07:48,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 23:07:48,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 23:07:48,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:07:48,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:07:48,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:07:48,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:07:48,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2024-11-21 23:07:48,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:07:48,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:07:48,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:07:48,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:07:48,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:07:48,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c [2024-11-21 23:07:49,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:07:49,622 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:07:49,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c [2024-11-21 23:07:49,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad98a9da/35f57250c2c642bf9993869e44777934/FLAG73521baa5 [2024-11-21 23:07:49,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad98a9da/35f57250c2c642bf9993869e44777934 [2024-11-21 23:07:49,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:07:49,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:07:49,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:07:49,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:07:49,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:07:49,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502c3ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49, skipping insertion in model container [2024-11-21 23:07:49,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:07:49,812 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[627,640] [2024-11-21 23:07:49,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:07:49,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:07:49,845 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[627,640] [2024-11-21 23:07:49,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:07:49,862 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:07:49,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49 WrapperNode [2024-11-21 23:07:49,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:07:49,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:07:49,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:07:49,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:07:49,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,888 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-21 23:07:49,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:07:49,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:07:49,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:07:49,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:07:49,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,908 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]. [2024-11-21 23:07:49,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:07:49,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:07:49,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:07:49,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:07:49,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (1/1) ... [2024-11-21 23:07:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:07:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:07:49,955 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) [2024-11-21 23:07:49,957 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 [2024-11-21 23:07:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:07:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 23:07:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:07:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:07:50,036 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:07:50,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:07:50,120 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-21 23:07:50,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:07:50,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:07:50,135 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 23:07:50,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:07:50 BoogieIcfgContainer [2024-11-21 23:07:50,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:07:50,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:07:50,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:07:50,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:07:50,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:07:49" (1/3) ... [2024-11-21 23:07:50,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150e64c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:07:50, skipping insertion in model container [2024-11-21 23:07:50,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:49" (2/3) ... [2024-11-21 23:07:50,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150e64c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:07:50, skipping insertion in model container [2024-11-21 23:07:50,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:07:50" (3/3) ... [2024-11-21 23:07:50,145 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2024-11-21 23:07:50,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:07:50,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:07:50,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:07:50,207 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;@7eaa1e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:07:50,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:07:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 23:07:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-21 23:07:50,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:07:50,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:07:50,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:07:50,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:07:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2024-11-21 23:07:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:07:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413012903] [2024-11-21 23:07:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:07:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:07:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:07:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:07:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:07:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413012903] [2024-11-21 23:07:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413012903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:07:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:07:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:07:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118510707] [2024-11-21 23:07:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:07:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:07:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:07:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:07:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:07:50,350 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-21 23:07:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:07:50,360 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-21 23:07:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:07:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-21 23:07:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:07:50,368 INFO L225 Difference]: With dead ends: 30 [2024-11-21 23:07:50,369 INFO L226 Difference]: Without dead ends: 12 [2024-11-21 23:07:50,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:07:50,376 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:07:50,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:07:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-21 23:07:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-21 23:07:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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) [2024-11-21 23:07:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-21 23:07:50,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2024-11-21 23:07:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:07:50,416 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-21 23:07:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-21 23:07:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-21 23:07:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-21 23:07:50,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:07:50,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:07:50,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 23:07:50,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:07:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:07:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2024-11-21 23:07:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:07:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099794089] [2024-11-21 23:07:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:07:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:07:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:07:50,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:07:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:07:50,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 23:07:50,471 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:07:50,473 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:07:50,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 23:07:50,477 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 23:07:50,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:07:50,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:07:50 BoogieIcfgContainer [2024-11-21 23:07:50,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:07:50,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:07:50,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:07:50,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:07:50,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:07:50" (3/4) ... [2024-11-21 23:07:50,501 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 23:07:50,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:07:50,504 INFO L158 Benchmark]: Toolchain (without parser) took 858.40ms. Allocated memory is still 163.6MB. Free memory was 110.3MB in the beginning and 127.4MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:07:50,504 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:07:50,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.09ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 97.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 23:07:50,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.55ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:07:50,507 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 94.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:07:50,507 INFO L158 Benchmark]: RCFGBuilder took 209.87ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 84.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 23:07:50,507 INFO L158 Benchmark]: TraceAbstraction took 359.97ms. Allocated memory is still 163.6MB. Free memory was 83.5MB in the beginning and 128.4MB in the end (delta: -44.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:07:50,507 INFO L158 Benchmark]: Witness Printer took 5.72ms. Allocated memory is still 163.6MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:07:50,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.09ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 97.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.55ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 94.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 209.87ms. Allocated memory is still 163.6MB. Free memory was 94.4MB in the beginning and 84.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 359.97ms. Allocated memory is still 163.6MB. Free memory was 83.5MB in the beginning and 128.4MB in the end (delta: -44.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.72ms. Allocated memory is still 163.6MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. 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: 17]: 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 41, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [i=0] [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-21 23:07:50,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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.5.800.v20200727-1323.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 -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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:07:52,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:07:52,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 23:07:52,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:07:52,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:07:52,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:07:52,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:07:52,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:07:52,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:07:52,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:07:52,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:07:52,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:07:52,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:07:52,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:07:52,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:07:52,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:07:52,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:07:52,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:07:52,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:07:52,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:07:52,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:07:52,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:07:52,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:07:52,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 23:07:52,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 23:07:52,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:07:52,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:07:52,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:07:52,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 23:07:52,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:07:52,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:07:52,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:07:52,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:07:52,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2024-11-21 23:07:52,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:07:52,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:07:52,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:07:52,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:07:52,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:07:52,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c [2024-11-21 23:07:53,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:07:53,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:07:53,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c [2024-11-21 23:07:53,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae1818a/9456d925631546e9844f092449cadb31/FLAG52552e002 [2024-11-21 23:07:54,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae1818a/9456d925631546e9844f092449cadb31 [2024-11-21 23:07:54,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:07:54,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:07:54,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:07:54,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:07:54,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:07:54,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9563ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54, skipping insertion in model container [2024-11-21 23:07:54,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:07:54,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2024-11-21 23:07:54,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:07:54,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:07:54,214 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[627,640] [2024-11-21 23:07:54,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:07:54,234 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:07:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54 WrapperNode [2024-11-21 23:07:54,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:07:54,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:07:54,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:07:54,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:07:54,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,262 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-21 23:07:54,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:07:54,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:07:54,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:07:54,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:07:54,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,283 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]. [2024-11-21 23:07:54,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:07:54,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:07:54,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:07:54,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:07:54,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (1/1) ... [2024-11-21 23:07:54,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:07:54,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:07:54,325 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) [2024-11-21 23:07:54,327 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 [2024-11-21 23:07:54,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:07:54,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 23:07:54,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:07:54,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:07:54,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:07:54,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:07:58,584 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-21 23:07:58,584 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:07:58,592 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:07:58,593 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 23:07:58,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:07:58 BoogieIcfgContainer [2024-11-21 23:07:58,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:07:58,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:07:58,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:07:58,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:07:58,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:07:54" (1/3) ... [2024-11-21 23:07:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8be81b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:07:58, skipping insertion in model container [2024-11-21 23:07:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:07:54" (2/3) ... [2024-11-21 23:07:58,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8be81b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:07:58, skipping insertion in model container [2024-11-21 23:07:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:07:58" (3/3) ... [2024-11-21 23:07:58,602 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2024-11-21 23:07:58,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:07:58,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:07:58,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:07:58,667 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;@4795b99e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:07:58,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:07:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 23:07:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-21 23:07:58,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:07:58,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:07:58,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:07:58,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:07:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2024-11-21 23:07:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:07:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256670883] [2024-11-21 23:07:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:07:58,688 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 [2024-11-21 23:07:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:07:58,690 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) [2024-11-21 23:07:58,692 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 [2024-11-21 23:07:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:07:58,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-21 23:07:58,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:07:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:07:58,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:07:58,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:07:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256670883] [2024-11-21 23:07:58,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256670883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:07:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:07:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:07:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912712895] [2024-11-21 23:07:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:07:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:07:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:07:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:07:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:07:58,804 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-21 23:07:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:07:58,817 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-21 23:07:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:07:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-21 23:07:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:07:58,826 INFO L225 Difference]: With dead ends: 30 [2024-11-21 23:07:58,827 INFO L226 Difference]: Without dead ends: 12 [2024-11-21 23:07:58,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:07:58,833 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:07:58,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:07:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-21 23:07:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-21 23:07:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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) [2024-11-21 23:07:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-21 23:07:58,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2024-11-21 23:07:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:07:58,861 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-21 23:07:58,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-21 23:07:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-21 23:07:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-21 23:07:58,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:07:58,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:07:58,869 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 [2024-11-21 23:07:59,063 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 [2024-11-21 23:07:59,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:07:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:07:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2024-11-21 23:07:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:07:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031118926] [2024-11-21 23:07:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:07:59,066 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 [2024-11-21 23:07:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:07:59,067 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) [2024-11-21 23:07:59,068 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 [2024-11-21 23:07:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:07:59,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 23:07:59,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:07:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:07:59,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:07:59,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:07:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031118926] [2024-11-21 23:07:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031118926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:07:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:07:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:07:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348048776] [2024-11-21 23:07:59,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:07:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:07:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:07:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:07:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:07:59,266 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-21 23:08:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:08:00,252 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-21 23:08:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:08:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-21 23:08:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:08:00,253 INFO L225 Difference]: With dead ends: 22 [2024-11-21 23:08:00,253 INFO L226 Difference]: Without dead ends: 20 [2024-11-21 23:08:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:08:00,254 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 23:08:00,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 23:08:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-21 23:08:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2024-11-21 23:08:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 23:08:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-21 23:08:00,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-11-21 23:08:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:08:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-21 23:08:00,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-21 23:08:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-21 23:08:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-21 23:08:00,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:08:00,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:08:00,262 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 [2024-11-21 23:08:00,458 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 [2024-11-21 23:08:00,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:08:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:08:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2024-11-21 23:08:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:08:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137011689] [2024-11-21 23:08:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:08:00,460 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 [2024-11-21 23:08:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:08:00,462 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) [2024-11-21 23:08:00,463 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 [2024-11-21 23:08:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:08:00,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:08:00,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:08:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:08:01,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:08:01,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:08:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137011689] [2024-11-21 23:08:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137011689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:08:01,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:08:01,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 23:08:01,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154180166] [2024-11-21 23:08:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:08:01,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 23:08:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:08:01,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 23:08:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 23:08:01,876 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) [2024-11-21 23:08:07,838 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 [0] [2024-11-21 23:08:12,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:08:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:08:12,408 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-21 23:08:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 23:08:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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 9 [2024-11-21 23:08:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:08:12,437 INFO L225 Difference]: With dead ends: 29 [2024-11-21 23:08:12,437 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 23:08:12,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-21 23:08:12,439 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-21 23:08:12,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-21 23:08:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 23:08:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2024-11-21 23:08:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 23:08:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-21 23:08:12,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2024-11-21 23:08:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:08:12,443 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-21 23:08:12,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) [2024-11-21 23:08:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-21 23:08:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:08:12,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:08:12,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:08:12,455 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-21 23:08:12,644 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 [2024-11-21 23:08:12,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:08:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:08:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2024-11-21 23:08:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:08:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246087473] [2024-11-21 23:08:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:08:12,646 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 [2024-11-21 23:08:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:08:12,648 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) [2024-11-21 23:08:12,649 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 [2024-11-21 23:08:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:08:12,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-21 23:08:12,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:08:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:08:31,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 23:08:41,125 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 23:08:49,262 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 23:08:53,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2024-11-21 23:08:57,336 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2024-11-21 23:09:05,460 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 23:09:13,582 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 23:09:21,720 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-21 23:09:29,855 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)