./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:25:22,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:25:22,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:25:22,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:25:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:25:22,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:25:22,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:25:22,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:25:22,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:25:22,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:25:22,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:25:22,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:25:22,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:25:22,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:25:22,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:25:22,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:25:22,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:25:22,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:25:22,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:25:22,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:25:22,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:25:22,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:25:22,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:25:22,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:25:22,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:25:22,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:25:22,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:25:22,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:25:22,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:25:22,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:25:22,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:25:22,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:25:22,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:25:22,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:25:22,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:25:22,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:25:22,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:25:22,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:25:22,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:25:22,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:25:22,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:25:22,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:25:22,778 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2024-11-18 11:25:23,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:25:23,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:25:23,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:25:23,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:25:23,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:25:23,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2024-11-18 11:25:24,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:25:24,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:25:24,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2024-11-18 11:25:24,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2329fd341/9794e3807fe143d29016a76195cb706c/FLAG96df3dce6 [2024-11-18 11:25:24,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2329fd341/9794e3807fe143d29016a76195cb706c [2024-11-18 11:25:24,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:25:24,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:25:24,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:25:24,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:25:24,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:25:24,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:24" (1/1) ... [2024-11-18 11:25:24,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d48a06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:24, skipping insertion in model container [2024-11-18 11:25:24,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:24" (1/1) ... [2024-11-18 11:25:24,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:25:24,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2024-11-18 11:25:24,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2024-11-18 11:25:24,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:25:25,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:25:25,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2024-11-18 11:25:25,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2024-11-18 11:25:25,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:25:25,062 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:25:25,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25 WrapperNode [2024-11-18 11:25:25,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:25:25,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:25:25,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:25:25,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:25:25,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,098 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2024-11-18 11:25:25,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:25:25,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:25:25,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:25:25,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:25:25,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,120 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-18 11:25:25,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:25:25,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:25:25,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:25:25,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:25:25,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (1/1) ... [2024-11-18 11:25:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:25:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:25:25,174 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-18 11:25:25,177 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-18 11:25:25,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:25:25,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:25:25,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:25:25,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:25:25,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:25:25,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:25:25,502 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-18 11:25:25,502 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:25:25,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:25:25,515 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 11:25:25,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:25 BoogieIcfgContainer [2024-11-18 11:25:25,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:25:25,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:25:25,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:25:25,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:25:25,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:25:24" (1/3) ... [2024-11-18 11:25:25,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bdd417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:25, skipping insertion in model container [2024-11-18 11:25:25,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:25" (2/3) ... [2024-11-18 11:25:25,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bdd417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:25, skipping insertion in model container [2024-11-18 11:25:25,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:25" (3/3) ... [2024-11-18 11:25:25,524 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2024-11-18 11:25:25,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:25:25,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 11:25:25,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:25:25,616 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;@526cbf42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:25:25,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 11:25:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:25:25,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:25:25,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:25:25,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:25:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:25:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2024-11-18 11:25:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:25:25,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049323168] [2024-11-18 11:25:25,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:25:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:25:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:25:25,913 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-18 11:25:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:25:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049323168] [2024-11-18 11:25:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049323168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:25:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:25:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 11:25:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337313353] [2024-11-18 11:25:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:25:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 11:25:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:25:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 11:25:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:25:25,945 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:25:26,028 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2024-11-18 11:25:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 11:25:26,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 11:25:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:25:26,038 INFO L225 Difference]: With dead ends: 40 [2024-11-18 11:25:26,039 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 11:25:26,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 11:25:26,046 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:25:26,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:25:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 11:25:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-18 11:25:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-18 11:25:26,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2024-11-18 11:25:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:25:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-18 11:25:26,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-18 11:25:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:25:26,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:25:26,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:25:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:25:26,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:25:26,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:25:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2024-11-18 11:25:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:25:26,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089086818] [2024-11-18 11:25:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:25:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:25:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:25:26,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:25:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:25:26,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 11:25:26,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:25:26,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 11:25:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 11:25:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:25:26,170 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-18 11:25:26,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:25:26,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:25:26 BoogieIcfgContainer [2024-11-18 11:25:26,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:25:26,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:25:26,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:25:26,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:25:26,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:25" (3/4) ... [2024-11-18 11:25:26,294 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 11:25:26,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:25:26,296 INFO L158 Benchmark]: Toolchain (without parser) took 1557.15ms. Allocated memory is still 182.5MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:25:26,297 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:25:26,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.67ms. Allocated memory is still 182.5MB. Free memory was 151.1MB in the beginning and 137.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 11:25:26,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.96ms. Allocated memory is still 182.5MB. Free memory was 137.4MB in the beginning and 136.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:25:26,300 INFO L158 Benchmark]: Boogie Preprocessor took 34.59ms. Allocated memory is still 182.5MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:25:26,301 INFO L158 Benchmark]: RCFGBuilder took 382.15ms. Allocated memory is still 182.5MB. Free memory was 134.3MB in the beginning and 120.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 11:25:26,302 INFO L158 Benchmark]: TraceAbstraction took 770.93ms. Allocated memory is still 182.5MB. Free memory was 119.6MB in the beginning and 150.0MB in the end (delta: -30.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-18 11:25:26,303 INFO L158 Benchmark]: Witness Printer took 5.71ms. Allocated memory is still 182.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:25:26,304 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.20ms. Allocated memory is still 121.6MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.67ms. Allocated memory is still 182.5MB. Free memory was 151.1MB in the beginning and 137.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.96ms. Allocated memory is still 182.5MB. Free memory was 137.4MB in the beginning and 136.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.59ms. Allocated memory is still 182.5MB. Free memory was 136.4MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.15ms. Allocated memory is still 182.5MB. Free memory was 134.3MB in the beginning and 120.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 770.93ms. Allocated memory is still 182.5MB. Free memory was 119.6MB in the beginning and 150.0MB in the end (delta: -30.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 5.71ms. Allocated memory is still 182.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 41. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 42 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 11:25:26,351 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/11.0.12-open/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.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:25:28,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:25:28,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 11:25:28,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:25:28,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:25:28,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:25:28,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:25:28,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:25:28,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:25:28,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:25:28,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:25:28,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:25:28,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:25:28,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:25:28,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:25:28,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:25:28,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:25:28,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:25:28,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:25:28,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:25:28,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:25:28,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:25:28,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:25:28,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 11:25:28,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 11:25:28,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:25:28,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 11:25:28,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:25:28,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:25:28,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:25:28,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:25:28,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:25:28,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:25:28,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:25:28,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:25:28,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:25:28,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:25:28,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:25:28,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 11:25:28,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 11:25:28,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:25:28,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:25:28,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:25:28,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:25:28,808 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2024-11-18 11:25:29,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:25:29,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:25:29,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:25:29,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:25:29,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:25:29,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2024-11-18 11:25:30,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:25:31,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:25:31,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2024-11-18 11:25:31,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282f49feb/189c19f6d85e42b3b2ce293688a15b91/FLAG93c53b7f5 [2024-11-18 11:25:31,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282f49feb/189c19f6d85e42b3b2ce293688a15b91 [2024-11-18 11:25:31,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:25:31,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:25:31,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:25:31,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:25:31,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:25:31,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cae13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31, skipping insertion in model container [2024-11-18 11:25:31,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:25:31,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2024-11-18 11:25:31,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2024-11-18 11:25:31,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:25:31,451 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:25:31,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2024-11-18 11:25:31,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2024-11-18 11:25:31,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:25:31,503 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:25:31,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31 WrapperNode [2024-11-18 11:25:31,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:25:31,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:25:31,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:25:31,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:25:31,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,544 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2024-11-18 11:25:31,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:25:31,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:25:31,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:25:31,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:25:31,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,584 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-18 11:25:31,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:25:31,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:25:31,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:25:31,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:25:31,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (1/1) ... [2024-11-18 11:25:31,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:25:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:25:31,651 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-18 11:25:31,657 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-18 11:25:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:25:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 11:25:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:25:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:25:31,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:25:31,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:25:40,211 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-18 11:25:40,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:25:40,225 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:25:40,226 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 11:25:40,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:40 BoogieIcfgContainer [2024-11-18 11:25:40,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:25:40,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:25:40,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:25:40,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:25:40,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:25:31" (1/3) ... [2024-11-18 11:25:40,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b8c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:40, skipping insertion in model container [2024-11-18 11:25:40,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:31" (2/3) ... [2024-11-18 11:25:40,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b8c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:40, skipping insertion in model container [2024-11-18 11:25:40,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:40" (3/3) ... [2024-11-18 11:25:40,235 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2024-11-18 11:25:40,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:25:40,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 11:25:40,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:25:40,321 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;@9579bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:25:40,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 11:25:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:25:40,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:25:40,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:25:40,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:25:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:25:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2024-11-18 11:25:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:25:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217588228] [2024-11-18 11:25:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:25:40,348 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-18 11:25:40,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:25:40,352 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-18 11:25:40,354 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-18 11:25:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:25:40,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 11:25:40,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:25:40,697 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-18 11:25:40,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:25:40,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:25:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217588228] [2024-11-18 11:25:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217588228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:25:40,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:25:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:25:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521178793] [2024-11-18 11:25:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:25:40,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:25:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:25:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:25:40,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:25:40,735 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:25:40,880 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2024-11-18 11:25:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:25:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 11:25:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:25:40,890 INFO L225 Difference]: With dead ends: 40 [2024-11-18 11:25:40,890 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 11:25:40,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:25:40,899 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:25:40,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:25:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 11:25:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-18 11:25:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-18 11:25:40,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2024-11-18 11:25:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:25:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-18 11:25:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-18 11:25:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:25:40,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:25:40,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:25:40,941 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 (2)] Forceful destruction successful, exit code 0 [2024-11-18 11:25:41,138 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-18 11:25:41,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:25:41,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:25:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2024-11-18 11:25:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:25:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327108663] [2024-11-18 11:25:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:25:41,141 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-18 11:25:41,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:25:41,144 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-18 11:25:41,146 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-18 11:25:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:25:41,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 11:25:41,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:25:41,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-18 11:25:41,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:25:41,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:25:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327108663] [2024-11-18 11:25:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327108663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:25:41,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:25:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:25:41,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87015787] [2024-11-18 11:25:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:25:41,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:25:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:25:41,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:25:41,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:25:41,263 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:25:42,742 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2024-11-18 11:25:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:25:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 11:25:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:25:42,744 INFO L225 Difference]: With dead ends: 71 [2024-11-18 11:25:42,744 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 11:25:42,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:25:42,746 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-18 11:25:42,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-18 11:25:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 11:25:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2024-11-18 11:25:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-18 11:25:42,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2024-11-18 11:25:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:25:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-18 11:25:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-18 11:25:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:25:42,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:25:42,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:25:42,763 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 (3)] Forceful destruction successful, exit code 0 [2024-11-18 11:25:42,958 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-18 11:25:42,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:25:42,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:25:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2024-11-18 11:25:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:25:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059954779] [2024-11-18 11:25:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:25:42,960 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-18 11:25:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:25:42,963 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-18 11:25:42,964 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-18 11:25:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:25:43,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 11:25:43,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:25:44,332 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-18 11:25:44,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:25:44,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:25:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059954779] [2024-11-18 11:25:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059954779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:25:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:25:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:25:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485569649] [2024-11-18 11:25:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:25:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 11:25:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:25:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 11:25:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 11:25:44,335 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:25:49,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:25:53,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:25:57,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:01,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:26:02,325 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-11-18 11:26:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:26:02,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 11:26:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:26:02,343 INFO L225 Difference]: With dead ends: 67 [2024-11-18 11:26:02,343 INFO L226 Difference]: Without dead ends: 44 [2024-11-18 11:26:02,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 11:26:02,344 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:26:02,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 46 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 18.0s Time] [2024-11-18 11:26:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-18 11:26:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2024-11-18 11:26:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-18 11:26:02,348 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2024-11-18 11:26:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:26:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-18 11:26:02,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-18 11:26:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:26:02,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:26:02,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:26:02,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 11:26:02,550 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-18 11:26:02,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:26:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:26:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2024-11-18 11:26:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:26:02,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291145342] [2024-11-18 11:26:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:26:02,567 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-18 11:26:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:26:02,572 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-18 11:26:02,575 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-18 11:26:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:26:02,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 11:26:02,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:26:02,683 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-18 11:26:02,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:26:02,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:26:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291145342] [2024-11-18 11:26:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291145342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:26:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:26:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:26:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672172019] [2024-11-18 11:26:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:26:02,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:26:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:26:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:26:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:26:02,691 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:26:02,743 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-18 11:26:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:26:02,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 11:26:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:26:02,745 INFO L225 Difference]: With dead ends: 49 [2024-11-18 11:26:02,745 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 11:26:02,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:26:02,746 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:26:02,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:26:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 11:26:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 11:26:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-18 11:26:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-18 11:26:02,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2024-11-18 11:26:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:26:02,756 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-18 11:26:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-18 11:26:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:26:02,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:26:02,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:26:02,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 11:26:02,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:26:02,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:26:02,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:26:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2024-11-18 11:26:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:26:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536314542] [2024-11-18 11:26:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:26:02,964 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-18 11:26:02,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:26:02,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:26:02,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 11:26:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:26:03,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 11:26:03,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:26:03,125 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-18 11:26:03,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:26:03,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:26:03,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536314542] [2024-11-18 11:26:03,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536314542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:26:03,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:26:03,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:26:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638547223] [2024-11-18 11:26:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:26:03,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:26:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:26:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:26:03,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:26:03,127 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:26:03,250 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-18 11:26:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:26:03,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 11:26:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:26:03,255 INFO L225 Difference]: With dead ends: 33 [2024-11-18 11:26:03,255 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 11:26:03,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:26:03,256 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:26:03,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:26:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 11:26:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 11:26:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-18 11:26:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-18 11:26:03,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2024-11-18 11:26:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:26:03,261 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-18 11:26:03,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-18 11:26:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:26:03,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:26:03,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:26:03,266 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 (6)] Forceful destruction successful, exit code 0 [2024-11-18 11:26:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-18 11:26:03,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:26:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:26:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2024-11-18 11:26:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:26:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017395393] [2024-11-18 11:26:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:26:03,464 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-18 11:26:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:26:03,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 11:26:03,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 11:26:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:26:03,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 11:26:03,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:26:26,336 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-18 11:26:26,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:26:26,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:26:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017395393] [2024-11-18 11:26:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017395393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:26:26,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:26:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 11:26:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137910712] [2024-11-18 11:26:26,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:26:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 11:26:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:26:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 11:26:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=51, Unknown=1, NotChecked=0, Total=90 [2024-11-18 11:26:26,340 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:26:28,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:41,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:45,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:49,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:51,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:56,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:26:57,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:27:01,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 11:27:05,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]