./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:25:31,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:25:31,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 19:25:31,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:25:31,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:25:31,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:25:31,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:25:31,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:25:31,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:25:31,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:25:31,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:25:31,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:25:31,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:25:31,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:25:31,238 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:25:31,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:25:31,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:25:31,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:25:31,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 19:25:31,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:25:31,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:25:31,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:25:31,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:25:31,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:25:31,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:25:31,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:25:31,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:25:31,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:25:31,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:25:31,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:25:31,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:25:31,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:25:31,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:31,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:25:31,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:25:31,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:25:31,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:25:31,264 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2024-11-19 19:25:31,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:25:31,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:25:31,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:25:31,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:25:31,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:25:31,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-11-19 19:25:32,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:25:33,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:25:33,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-11-19 19:25:33,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2912fcb/bc4ce03e805348d5a06e3636963f1cd7/FLAG6e32dbc3a [2024-11-19 19:25:33,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2912fcb/bc4ce03e805348d5a06e3636963f1cd7 [2024-11-19 19:25:33,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:25:33,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:25:33,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:33,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:25:33,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:25:33,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d30ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33, skipping insertion in model container [2024-11-19 19:25:33,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:25:33,396 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-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-19 19:25:33,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:33,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:25:33,426 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-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-19 19:25:33,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:33,442 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:25:33,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33 WrapperNode [2024-11-19 19:25:33,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:33,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:33,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:25:33,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:25:33,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,483 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-19 19:25:33,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:33,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:25:33,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:25:33,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:25:33,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,515 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 19:25:33,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:25:33,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:25:33,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:25:33,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:25:33,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (1/1) ... [2024-11-19 19:25:33,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:33,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:25:33,575 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-19 19:25:33,579 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-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:25:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-19 19:25:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-19 19:25:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 19:25:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 19:25:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 19:25:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:25:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:25:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 19:25:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 19:25:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 19:25:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:25:33,729 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:25:33,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:25:33,995 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 19:25:33,995 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:25:34,015 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:25:34,016 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 19:25:34,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:34 BoogieIcfgContainer [2024-11-19 19:25:34,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:25:34,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:25:34,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:25:34,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:25:34,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:33" (1/3) ... [2024-11-19 19:25:34,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb40434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:34, skipping insertion in model container [2024-11-19 19:25:34,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:33" (2/3) ... [2024-11-19 19:25:34,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb40434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:34, skipping insertion in model container [2024-11-19 19:25:34,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:34" (3/3) ... [2024-11-19 19:25:34,026 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2024-11-19 19:25:34,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:25:34,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:25:34,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:25:34,118 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;@22438ba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:25:34,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:25:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:25:34,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:34,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:34,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-19 19:25:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:34,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006638621] [2024-11-19 19:25:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,349 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-19 19:25:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006638621] [2024-11-19 19:25:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006638621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 19:25:34,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766088253] [2024-11-19 19:25:34,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:34,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 19:25:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 19:25:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:25:34,383 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:34,420 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-19 19:25:34,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 19:25:34,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:25:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:34,427 INFO L225 Difference]: With dead ends: 55 [2024-11-19 19:25:34,428 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:25:34,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-19 19:25:34,433 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:34,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:25:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 19:25:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:25:34,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-19 19:25:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:34,477 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:25:34,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:25:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:25:34,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:34,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:34,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 19:25:34,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:34,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-19 19:25:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750805302] [2024-11-19 19:25:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,752 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-19 19:25:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750805302] [2024-11-19 19:25:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750805302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565718981] [2024-11-19 19:25:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:34,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:34,756 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:34,811 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-19 19:25:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:34,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:25:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:34,816 INFO L225 Difference]: With dead ends: 39 [2024-11-19 19:25:34,816 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:25:34,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:34,818 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:34,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:25:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 19:25:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:34,826 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-19 19:25:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:34,827 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:25:34,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:34,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 19:25:34,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-19 19:25:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508039725] [2024-11-19 19:25:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:34,976 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-19 19:25:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508039725] [2024-11-19 19:25:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508039725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:34,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522959975] [2024-11-19 19:25:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:34,997 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:35,039 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:25:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:35,041 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:35,041 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:35,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:35,042 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:35,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:35,054 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-19 19:25:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:35,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:25:35,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:35,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:35,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 19:25:35,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:35,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-19 19:25:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373303523] [2024-11-19 19:25:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:35,274 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-19 19:25:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373303523] [2024-11-19 19:25:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373303523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:35,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116840151] [2024-11-19 19:25:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:35,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:35,280 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:35,334 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:25:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:35,336 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:35,337 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:35,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:35,339 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:35,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:35,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-19 19:25:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:35,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:25:35,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:35,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:35,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 19:25:35,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:35,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-19 19:25:35,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:35,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237195113] [2024-11-19 19:25:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:35,491 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-19 19:25:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237195113] [2024-11-19 19:25:35,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237195113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:35,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437939174] [2024-11-19 19:25:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:35,496 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:35,548 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 19:25:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:35,550 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:35,550 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:35,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:35,551 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:35,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:35,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-19 19:25:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:25:35,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:35,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 19:25:35,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:35,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-19 19:25:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188184578] [2024-11-19 19:25:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:25:35,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 19:25:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:25:35,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 19:25:35,631 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 19:25:35,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:25:35,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 19:25:35,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 19:25:35,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:25:35,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:35 BoogieIcfgContainer [2024-11-19 19:25:35,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:25:35,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:25:35,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:25:35,675 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:25:35,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:34" (3/4) ... [2024-11-19 19:25:35,680 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 19:25:35,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:25:35,681 INFO L158 Benchmark]: Toolchain (without parser) took 2510.36ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 116.2MB in the beginning and 100.8MB in the end (delta: 15.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,681 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 117.1MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:35,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.41ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 102.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 148.9MB. Free memory was 102.9MB in the beginning and 100.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,682 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 148.9MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,682 INFO L158 Benchmark]: RCFGBuilder took 485.94ms. Allocated memory is still 148.9MB. Free memory was 98.8MB in the beginning and 111.8MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,683 INFO L158 Benchmark]: TraceAbstraction took 1656.71ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 111.8MB in the beginning and 100.8MB in the end (delta: 11.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-11-19 19:25:35,683 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 180.4MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:35,684 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.17ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 117.1MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.41ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 102.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 148.9MB. Free memory was 102.9MB in the beginning and 100.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 148.9MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.94ms. Allocated memory is still 148.9MB. Free memory was 98.8MB in the beginning and 111.8MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1656.71ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 111.8MB in the beginning and 100.8MB in the end (delta: 11.0MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 180.4MB. Free memory is still 100.8MB. 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: 87]: 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 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967306] [L26] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L54] RET, EXPR __fpclassify_double(x) VAL [x=4294967306, y=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\result=0, x=4294967306] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-19 19:25:35,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:25:37,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:25:37,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 19:25:38,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:25:38,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:25:38,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:25:38,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:25:38,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:25:38,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:25:38,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:25:38,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:25:38,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:25:38,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:25:38,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:25:38,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:25:38,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:25:38,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:25:38,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:25:38,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:25:38,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:25:38,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:25:38,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:25:38,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:25:38,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 19:25:38,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 19:25:38,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:25:38,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 19:25:38,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:25:38,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:25:38,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:25:38,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:25:38,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:25:38,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:25:38,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:25:38,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:38,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:25:38,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:25:38,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:25:38,058 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 19:25:38,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 19:25:38,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:25:38,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:25:38,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:25:38,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:25:38,059 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2024-11-19 19:25:38,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:25:38,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:25:38,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:25:38,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:25:38,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:25:38,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-11-19 19:25:40,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:25:40,218 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:25:40,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-11-19 19:25:40,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0561f4c25/c27dc2b2c032455cb182f07fb2843903/FLAG9a0b646a0 [2024-11-19 19:25:40,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0561f4c25/c27dc2b2c032455cb182f07fb2843903 [2024-11-19 19:25:40,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:25:40,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:25:40,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:40,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:25:40,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:25:40,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:40,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40, skipping insertion in model container [2024-11-19 19:25:40,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:40,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:25:40,859 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-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-19 19:25:40,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:40,887 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:25:40,917 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-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-19 19:25:40,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:40,947 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:25:40,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40 WrapperNode [2024-11-19 19:25:40,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:40,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:40,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:25:40,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:25:40,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:40,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:40,995 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-19 19:25:40,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:40,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:25:40,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:25:40,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:25:41,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,033 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 19:25:41,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:25:41,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:25:41,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:25:41,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:25:41,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (1/1) ... [2024-11-19 19:25:41,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:41,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:25:41,106 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-19 19:25:41,110 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-19 19:25:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:25:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 19:25:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 19:25:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 19:25:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 19:25:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 19:25:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 19:25:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:25:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-19 19:25:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-19 19:25:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 19:25:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 19:25:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 19:25:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:25:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:25:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:25:41,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:25:41,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:25:41,509 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 19:25:41,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:25:41,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:25:41,544 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 19:25:41,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:41 BoogieIcfgContainer [2024-11-19 19:25:41,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:25:41,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:25:41,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:25:41,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:25:41,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:40" (1/3) ... [2024-11-19 19:25:41,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bb7e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:41, skipping insertion in model container [2024-11-19 19:25:41,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:40" (2/3) ... [2024-11-19 19:25:41,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bb7e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:41, skipping insertion in model container [2024-11-19 19:25:41,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:41" (3/3) ... [2024-11-19 19:25:41,556 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2024-11-19 19:25:41,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:25:41,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:25:41,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:25:41,646 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;@14dd712c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:25:41,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:25:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 19:25:41,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:41,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:41,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:41,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-19 19:25:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065683153] [2024-11-19 19:25:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:41,679 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-19 19:25:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:41,682 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-19 19:25:41,683 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-19 19:25:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:41,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 19:25:41,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:41,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:41,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:41,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065683153] [2024-11-19 19:25:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065683153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 19:25:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195066080] [2024-11-19 19:25:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 19:25:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 19:25:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 19:25:41,815 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:41,835 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-19 19:25:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 19:25:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 19:25:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:41,844 INFO L225 Difference]: With dead ends: 51 [2024-11-19 19:25:41,844 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:25:41,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 19:25:41,853 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:41,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:25:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 19:25:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-19 19:25:41,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-19 19:25:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-19 19:25:41,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-19 19:25:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:25:41,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:41,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:41,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 19:25:42,099 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-19 19:25:42,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-19 19:25:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988842398] [2024-11-19 19:25:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:42,102 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-19 19:25:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:42,105 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-19 19:25:42,106 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-19 19:25:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:42,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:42,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:42,263 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-19 19:25:42,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:42,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988842398] [2024-11-19 19:25:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988842398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:42,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:42,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317337594] [2024-11-19 19:25:42,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:42,282 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:42,513 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-19 19:25:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:25:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:42,516 INFO L225 Difference]: With dead ends: 36 [2024-11-19 19:25:42,516 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 19:25:42,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:42,518 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:42,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 19:25:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 19:25:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-19 19:25:42,526 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-19 19:25:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:42,526 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-19 19:25:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-19 19:25:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:25:42,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:42,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:42,534 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-19 19:25:42,730 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-19 19:25:42,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:42,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-19 19:25:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868530497] [2024-11-19 19:25:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:42,732 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-19 19:25:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:42,735 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-19 19:25:42,737 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-19 19:25:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:42,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 19:25:42,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:43,038 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-19 19:25:43,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:43,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868530497] [2024-11-19 19:25:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868530497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769124325] [2024-11-19 19:25:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:43,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:43,041 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:43,368 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-19 19:25:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:25:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:25:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:43,371 INFO L225 Difference]: With dead ends: 53 [2024-11-19 19:25:43,371 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:25:43,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:25:43,373 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:43,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:25:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-19 19:25:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 19:25:43,384 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-19 19:25:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:43,385 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 19:25:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-19 19:25:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:25:43,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:43,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:43,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:43,588 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-19 19:25:43,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:43,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1221479789, now seen corresponding path program 1 times [2024-11-19 19:25:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951967986] [2024-11-19 19:25:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:43,590 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-19 19:25:43,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:43,594 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-19 19:25:43,595 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-19 19:25:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:43,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:43,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:43,686 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-19 19:25:43,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:43,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951967986] [2024-11-19 19:25:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951967986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:43,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069829147] [2024-11-19 19:25:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:43,693 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:43,779 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-19 19:25:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:43,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:25:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:43,781 INFO L225 Difference]: With dead ends: 41 [2024-11-19 19:25:43,781 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 19:25:43,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:43,782 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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-19 19:25:43,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 19:25:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 19:25:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-19 19:25:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 19:25:43,791 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-11-19 19:25:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 19:25:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-19 19:25:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:25:43,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:43,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:43,798 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-19 19:25:43,996 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-19 19:25:43,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1991232473, now seen corresponding path program 1 times [2024-11-19 19:25:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083463645] [2024-11-19 19:25:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:43,998 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-19 19:25:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:44,000 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-19 19:25:44,002 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-19 19:25:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:44,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 19:25:44,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:44,263 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-19 19:25:44,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:44,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083463645] [2024-11-19 19:25:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083463645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397242850] [2024-11-19 19:25:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:44,267 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:44,513 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-19 19:25:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:25:44,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:25:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:44,516 INFO L225 Difference]: With dead ends: 53 [2024-11-19 19:25:44,517 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 19:25:44,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:44,518 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:44,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 19:25:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-19 19:25:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:25:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-19 19:25:44,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-19 19:25:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:44,525 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-19 19:25:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-19 19:25:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 19:25:44,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:44,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:44,534 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 (6)] Ended with exit code 0 [2024-11-19 19:25:44,732 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-19 19:25:44,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-19 19:25:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579306279] [2024-11-19 19:25:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:44,734 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-19 19:25:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:44,737 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-19 19:25:44,738 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-19 19:25:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:44,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:44,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:25:44,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:44,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579306279] [2024-11-19 19:25:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579306279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500919254] [2024-11-19 19:25:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:44,844 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:44,870 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-19 19:25:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 19:25:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:44,871 INFO L225 Difference]: With dead ends: 38 [2024-11-19 19:25:44,871 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 19:25:44,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:44,872 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:44,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 19:25:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 19:25:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-19 19:25:44,882 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2024-11-19 19:25:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:44,882 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-19 19:25:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-19 19:25:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 19:25:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:44,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:44,891 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 (7)] Ended with exit code 0 [2024-11-19 19:25:45,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-19 19:25:45,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:45,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-19 19:25:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433527494] [2024-11-19 19:25:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:45,086 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-19 19:25:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:45,089 INFO L229 MonitoredProcess]: Starting monitored process 8 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-19 19:25:45,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 19:25:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:45,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:45,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 19:25:45,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:45,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433527494] [2024-11-19 19:25:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433527494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021396745] [2024-11-19 19:25:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:45,239 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:45,282 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-19 19:25:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:45,283 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 19:25:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:45,283 INFO L225 Difference]: With dead ends: 34 [2024-11-19 19:25:45,283 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 19:25:45,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:45,285 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:45,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 19:25:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 19:25:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-19 19:25:45,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2024-11-19 19:25:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:45,291 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-19 19:25:45,292 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-19 19:25:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 19:25:45,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:45,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:45,299 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 (8)] Ended with exit code 0 [2024-11-19 19:25:45,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-19 19:25:45,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-19 19:25:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214152550] [2024-11-19 19:25:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:45,497 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-19 19:25:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:45,499 INFO L229 MonitoredProcess]: Starting monitored process 9 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-19 19:25:45,500 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 (9)] Waiting until timeout for monitored process [2024-11-19 19:25:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:45,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:45,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 19:25:45,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:45,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214152550] [2024-11-19 19:25:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214152550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729611958] [2024-11-19 19:25:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:45,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:45,730 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:46,081 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-19 19:25:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:25:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-19 19:25:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:46,083 INFO L225 Difference]: With dead ends: 45 [2024-11-19 19:25:46,083 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 19:25:46,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:25:46,084 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:46,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 19:25:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 19:25:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 19:25:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-19 19:25:46,088 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2024-11-19 19:25:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 19:25:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-19 19:25:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 19:25:46,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:46,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:46,096 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 (9)] Ended with exit code 0 [2024-11-19 19:25:46,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-19 19:25:46,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 178525002, now seen corresponding path program 1 times [2024-11-19 19:25:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616898430] [2024-11-19 19:25:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:46,292 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-19 19:25:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:46,293 INFO L229 MonitoredProcess]: Starting monitored process 10 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-19 19:25:46,294 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 (10)] Waiting until timeout for monitored process [2024-11-19 19:25:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:46,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:46,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:25:46,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:46,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616898430] [2024-11-19 19:25:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616898430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870853949] [2024-11-19 19:25:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:46,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:46,402 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:46,559 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-19 19:25:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 19:25:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:46,560 INFO L225 Difference]: With dead ends: 41 [2024-11-19 19:25:46,560 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 19:25:46,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:46,561 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:46,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 19:25:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-19 19:25:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:25:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-19 19:25:46,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-11-19 19:25:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 19:25:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-19 19:25:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 19:25:46,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:46,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:46,573 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:46,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-19 19:25:46,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1847075342, now seen corresponding path program 1 times [2024-11-19 19:25:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817263699] [2024-11-19 19:25:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:46,773 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-19 19:25:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:46,776 INFO L229 MonitoredProcess]: Starting monitored process 11 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-19 19:25:46,777 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 (11)] Waiting until timeout for monitored process [2024-11-19 19:25:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:46,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:46,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 19:25:46,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:46,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817263699] [2024-11-19 19:25:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817263699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:46,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162081172] [2024-11-19 19:25:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:46,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:46,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:46,968 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:47,143 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-19 19:25:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:25:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-19 19:25:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:47,144 INFO L225 Difference]: With dead ends: 38 [2024-11-19 19:25:47,144 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 19:25:47,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:47,145 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:47,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 19:25:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 19:25:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 19:25:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-19 19:25:47,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2024-11-19 19:25:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-19 19:25:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-19 19:25:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 19:25:47,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:47,153 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:47,160 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:47,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-19 19:25:47,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:47,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-19 19:25:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253191664] [2024-11-19 19:25:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:47,355 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-19 19:25:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:47,358 INFO L229 MonitoredProcess]: Starting monitored process 12 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-19 19:25:47,359 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 (12)] Waiting until timeout for monitored process [2024-11-19 19:25:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:47,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 19:25:47,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 19:25:47,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:47,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253191664] [2024-11-19 19:25:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253191664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 19:25:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710392467] [2024-11-19 19:25:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 19:25:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 19:25:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:47,606 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:47,686 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-19 19:25:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 19:25:47,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 19:25:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:47,688 INFO L225 Difference]: With dead ends: 23 [2024-11-19 19:25:47,688 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 19:25:47,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 19:25:47,689 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:47,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 19:25:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 19:25:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-19 19:25:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 19:25:47,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-19 19:25:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:47,690 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 19:25:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 19:25:47,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 19:25:47,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:25:47,699 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 (12)] Ended with exit code 0 [2024-11-19 19:25:47,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-19 19:25:47,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:47,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 19:25:48,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:25:48,295 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:48,296 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:48,296 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:48,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:48 BoogieIcfgContainer [2024-11-19 19:25:48,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:25:48,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:25:48,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:25:48,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:25:48,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:41" (3/4) ... [2024-11-19 19:25:48,304 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 19:25:48,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-19 19:25:48,312 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-19 19:25:48,312 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-19 19:25:48,313 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 19:25:48,313 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 19:25:48,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 19:25:48,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 19:25:48,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:25:48,398 INFO L158 Benchmark]: Toolchain (without parser) took 7799.18ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 40.5MB in the beginning and 43.4MB in the end (delta: -2.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,399 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:48,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.75ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 44.3MB in the end (delta: -4.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.10ms. Allocated memory is still 73.4MB. Free memory was 44.3MB in the beginning and 42.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:48,400 INFO L158 Benchmark]: Boogie Preprocessor took 68.88ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 40.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,400 INFO L158 Benchmark]: RCFGBuilder took 477.13ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 52.5MB in the end (delta: -12.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,400 INFO L158 Benchmark]: TraceAbstraction took 6753.57ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,401 INFO L158 Benchmark]: Witness Printer took 96.78ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 43.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 19:25:48,402 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.89ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.75ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 44.3MB in the end (delta: -4.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.10ms. Allocated memory is still 73.4MB. Free memory was 44.3MB in the beginning and 42.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.88ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 40.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 477.13ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 52.5MB in the end (delta: -12.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6753.57ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 51.7MB in the beginning and 48.3MB in the end (delta: 3.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 96.78ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 43.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 87]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 275 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 26 QuantifiedInterpolants, 839 SizeOfPredicates, 17 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-19 19:25:48,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE