./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1250.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:27:13,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:27:13,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 23:27:13,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:27:13,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:27:13,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:27:13,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:27:13,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:27:13,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:27:13,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:27:13,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:27:13,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:27:13,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:27:13,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:27:13,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:27:13,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:27:13,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:27:13,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:27:13,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 23:27:13,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:27:13,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:27:13,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:27:13,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:27:13,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:27:13,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:27:13,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:27:13,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:27:13,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:27:13,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:27:13,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:27:13,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:27:13,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:27:13,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:13,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:27:13,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:27:13,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:27:13,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 23:27:13,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 23:27:13,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:27:13,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:27:13,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:27:13,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:27:13,250 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-11-21 23:27:13,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:27:13,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:27:13,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:27:13,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:27:13,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:27:13,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-21 23:27:14,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:27:14,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:27:14,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-21 23:27:14,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67fdc2c8/a7bf7523d6a14414a04b76cda3c1751b/FLAG3c2ffaa9d [2024-11-21 23:27:15,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67fdc2c8/a7bf7523d6a14414a04b76cda3c1751b [2024-11-21 23:27:15,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:27:15,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:27:15,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:15,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:27:15,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:27:15,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508c7384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15, skipping insertion in model container [2024-11-21 23:27:15,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:27:15,514 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_1250.c[1965,1978] [2024-11-21 23:27:15,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:15,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:27:15,551 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_1250.c[1965,1978] [2024-11-21 23:27:15,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:15,575 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:27:15,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15 WrapperNode [2024-11-21 23:27:15,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:15,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:15,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:27:15,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:27:15,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,606 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-11-21 23:27:15,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:15,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:27:15,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:27:15,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:27:15,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,646 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-21 23:27:15,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:27:15,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:27:15,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:27:15,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:27:15,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (1/1) ... [2024-11-21 23:27:15,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:27:15,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 23:27:15,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 23:27:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:27:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 23:27:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 23:27:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:27:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-21 23:27:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-21 23:27:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-21 23:27:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-21 23:27:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:27:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:27:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 23:27:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 23:27:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:27:15,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:27:15,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:27:15,993 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-21 23:27:15,993 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:27:16,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:27:16,034 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 23:27:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:16 BoogieIcfgContainer [2024-11-21 23:27:16,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:27:16,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:27:16,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:27:16,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:27:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:27:15" (1/3) ... [2024-11-21 23:27:16,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504252f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:16, skipping insertion in model container [2024-11-21 23:27:16,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:15" (2/3) ... [2024-11-21 23:27:16,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504252f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:16, skipping insertion in model container [2024-11-21 23:27:16,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:16" (3/3) ... [2024-11-21 23:27:16,044 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-11-21 23:27:16,080 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:27:16,081 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:27:16,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:27:16,142 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;@66b41e05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:27:16,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:27:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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-21 23:27:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:27:16,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:16,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1998704113, now seen corresponding path program 1 times [2024-11-21 23:27:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972752730] [2024-11-21 23:27:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972752730] [2024-11-21 23:27:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972752730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:16,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:27:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985816246] [2024-11-21 23:27:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:16,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:27:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:27:16,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:27:16,335 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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 6.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-21 23:27:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:16,349 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2024-11-21 23:27:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:27:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.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-21 23:27:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:16,356 INFO L225 Difference]: With dead ends: 47 [2024-11-21 23:27:16,356 INFO L226 Difference]: Without dead ends: 22 [2024-11-21 23:27:16,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:27:16,361 INFO L432 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:16,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-21 23:27:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-21 23:27:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-21 23:27:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-21 23:27:16,390 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2024-11-21 23:27:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:16,391 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-21 23:27:16,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.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-21 23:27:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-11-21 23:27:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:27:16,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:16,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 23:27:16,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -259779316, now seen corresponding path program 1 times [2024-11-21 23:27:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358992358] [2024-11-21 23:27:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:16,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358992358] [2024-11-21 23:27:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358992358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622318251] [2024-11-21 23:27:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:16,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:16,531 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-21 23:27:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:16,549 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-21 23:27:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 23:27:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:16,552 INFO L225 Difference]: With dead ends: 31 [2024-11-21 23:27:16,552 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:27:16,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-21 23:27:16,553 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:16,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:27:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-21 23:27:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-21 23:27:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:27:16,559 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2024-11-21 23:27:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:16,560 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:27:16,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 23:27:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:27:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:27:16,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 23:27:16,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1459037804, now seen corresponding path program 1 times [2024-11-21 23:27:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167233814] [2024-11-21 23:27:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:16,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167233814] [2024-11-21 23:27:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167233814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603255425] [2024-11-21 23:27:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:16,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:16,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:16,661 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-21 23:27:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:16,680 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-21 23:27:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-21 23:27:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:16,685 INFO L225 Difference]: With dead ends: 35 [2024-11-21 23:27:16,685 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:27:16,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-21 23:27:16,686 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:16,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:27:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-21 23:27:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-21 23:27:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:27:16,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2024-11-21 23:27:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:27:16,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-21 23:27:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:27:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:27:16,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:16,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 23:27:16,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1378771472, now seen corresponding path program 1 times [2024-11-21 23:27:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13848497] [2024-11-21 23:27:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13848497] [2024-11-21 23:27:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13848497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556353231] [2024-11-21 23:27:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:16,771 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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-21 23:27:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:16,794 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-21 23:27:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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-21 23:27:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:16,796 INFO L225 Difference]: With dead ends: 35 [2024-11-21 23:27:16,796 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:27:16,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-21 23:27:16,799 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:16,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:27:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-21 23:27:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-21 23:27:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:27:16,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2024-11-21 23:27:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:16,808 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:27:16,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-21 23:27:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:27:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:27:16,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,809 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-21 23:27:16,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 23:27:16,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash 516662552, now seen corresponding path program 1 times [2024-11-21 23:27:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189863526] [2024-11-21 23:27:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:16,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189863526] [2024-11-21 23:27:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189863526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:16,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015196636] [2024-11-21 23:27:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:16,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:16,905 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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-21 23:27:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:16,921 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-21 23:27:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:16,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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-21 23:27:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:16,922 INFO L225 Difference]: With dead ends: 35 [2024-11-21 23:27:16,922 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:27:16,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-21 23:27:16,923 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:16,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:27:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-21 23:27:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-21 23:27:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:27:16,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 18 [2024-11-21 23:27:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:27:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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-21 23:27:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:27:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:27:16,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:16,929 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-21 23:27:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 23:27:16,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1290791911, now seen corresponding path program 1 times [2024-11-21 23:27:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765942203] [2024-11-21 23:27:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:16,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:27:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:16,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 23:27:16,969 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:27:16,970 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:27:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 23:27:16,974 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-21 23:27:16,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:27:16,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:27:16 BoogieIcfgContainer [2024-11-21 23:27:16,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:27:16,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:27:16,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:27:16,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:27:16,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:16" (3/4) ... [2024-11-21 23:27:16,999 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 23:27:17,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:27:17,000 INFO L158 Benchmark]: Toolchain (without parser) took 1668.55ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 92.2MB in the beginning and 96.3MB in the end (delta: -4.0MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-21 23:27:17,000 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:17,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.08ms. Allocated memory is still 148.9MB. Free memory was 92.2MB in the beginning and 79.1MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:27:17,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.09ms. Allocated memory is still 148.9MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:17,001 INFO L158 Benchmark]: Boogie Preprocessor took 51.19ms. Allocated memory is still 148.9MB. Free memory was 77.5MB in the beginning and 75.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:17,001 INFO L158 Benchmark]: RCFGBuilder took 375.54ms. Allocated memory is still 148.9MB. Free memory was 75.5MB in the beginning and 118.7MB in the end (delta: -43.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:17,002 INFO L158 Benchmark]: TraceAbstraction took 958.13ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 118.0MB in the beginning and 97.3MB in the end (delta: 20.7MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-11-21 23:27:17,002 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory was 97.3MB in the beginning and 96.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:17,003 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.15ms. Allocated memory is still 148.9MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.08ms. Allocated memory is still 148.9MB. Free memory was 92.2MB in the beginning and 79.1MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.09ms. Allocated memory is still 148.9MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.19ms. Allocated memory is still 148.9MB. Free memory was 77.5MB in the beginning and 75.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.54ms. Allocated memory is still 148.9MB. Free memory was 75.5MB in the beginning and 118.7MB in the end (delta: -43.2MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 958.13ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 118.0MB in the beginning and 97.3MB in the end (delta: 20.7MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory was 97.3MB in the beginning and 96.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 74]: 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 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L69] double x = 0.0 / 0.0; [L70] double y = 0.0 / 0.0; [L71] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967307] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967307, x=4294967307] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=2146435073, x=4294967307] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967307, \result=0, x=4294967307] [L57] RET, EXPR __fpclassify_double(x) VAL [x=4294967307, y=4294967306] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\result=4294967306, x=4294967307] [L71] RET, EXPR fmax_double(x, y) [L71] double res = fmax_double(x, y); [L73] CALL, EXPR isnan_double(res) [L18] return x != x; VAL [\result=0] [L73] RET, EXPR isnan_double(res) [L73] COND TRUE !isnan_double(res) [L74] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 150 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 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-21 23:27:17,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:27:18,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:27:18,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 23:27:18,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:27:18,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:27:19,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:27:19,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:27:19,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:27:19,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:27:19,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:27:19,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:27:19,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:27:19,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:27:19,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:27:19,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:27:19,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:27:19,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:27:19,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:27:19,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:27:19,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:27:19,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:27:19,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:27:19,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:27:19,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 23:27:19,016 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 23:27:19,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:27:19,016 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 23:27:19,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:27:19,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:27:19,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:27:19,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:27:19,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:27:19,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:19,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 23:27:19,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 23:27:19,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:27:19,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:27:19,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:27:19,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:27:19,020 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-11-21 23:27:19,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:27:19,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:27:19,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:27:19,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:27:19,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:27:19,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-21 23:27:20,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:27:20,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:27:20,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-11-21 23:27:20,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31852780b/b6f294be6e9c43d1842d9852ed52338a/FLAGb10576f23 [2024-11-21 23:27:20,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31852780b/b6f294be6e9c43d1842d9852ed52338a [2024-11-21 23:27:20,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:27:20,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:27:20,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:20,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:27:20,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:27:20,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:20" (1/1) ... [2024-11-21 23:27:20,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d462dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:20, skipping insertion in model container [2024-11-21 23:27:20,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:20" (1/1) ... [2024-11-21 23:27:20,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:27:21,017 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_1250.c[1965,1978] [2024-11-21 23:27:21,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:21,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:27:21,056 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_1250.c[1965,1978] [2024-11-21 23:27:21,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:21,079 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:27:21,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21 WrapperNode [2024-11-21 23:27:21,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:21,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:21,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:27:21,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:27:21,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,108 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-21 23:27:21,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:21,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:27:21,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:27:21,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:27:21,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,136 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-21 23:27:21,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:27:21,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:27:21,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:27:21,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:27:21,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (1/1) ... [2024-11-21 23:27:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:21,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:27:21,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 23:27:21,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:27:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-21 23:27:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-21 23:27:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-21 23:27:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-21 23:27:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:27:21,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:27:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:27:21,303 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:27:21,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:27:21,504 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-21 23:27:21,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:27:21,517 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:27:21,519 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 23:27:21,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:21 BoogieIcfgContainer [2024-11-21 23:27:21,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:27:21,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:27:21,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:27:21,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:27:21,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:27:20" (1/3) ... [2024-11-21 23:27:21,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c212b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:21, skipping insertion in model container [2024-11-21 23:27:21,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:21" (2/3) ... [2024-11-21 23:27:21,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c212b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:21, skipping insertion in model container [2024-11-21 23:27:21,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:21" (3/3) ... [2024-11-21 23:27:21,527 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-11-21 23:27:21,539 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:27:21,539 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:27:21,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:27:21,597 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;@721c6e8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:27:21,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:27:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-21 23:27:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-21 23:27:21,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:21,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:21,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -137544036, now seen corresponding path program 1 times [2024-11-21 23:27:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391313717] [2024-11-21 23:27:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:21,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:21,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:21,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-21 23:27:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:21,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-21 23:27:21,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:21,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:21,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391313717] [2024-11-21 23:27:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391313717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:21,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:27:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76920868] [2024-11-21 23:27:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:21,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:27:21,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:27:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:27:21,773 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-21 23:27:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:21,787 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2024-11-21 23:27:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:27:21,791 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-21 23:27:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:21,795 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:27:21,796 INFO L226 Difference]: Without dead ends: 20 [2024-11-21 23:27:21,798 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-21 23:27:21,804 INFO L432 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:21,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-21 23:27:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-21 23:27:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-21 23:27:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-21 23:27:21,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2024-11-21 23:27:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-21 23:27:21,838 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-21 23:27:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-21 23:27:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:27:21,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:21,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:21,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-21 23:27:22,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1479426789, now seen corresponding path program 1 times [2024-11-21 23:27:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464213156] [2024-11-21 23:27:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:22,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:22,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-21 23:27:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:22,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:22,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:22,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:22,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:22,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464213156] [2024-11-21 23:27:22,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464213156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:22,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:22,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236188976] [2024-11-21 23:27:22,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:22,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:22,209 INFO L87 Difference]: Start difference. First operand 20 states and 26 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-21 23:27:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:22,239 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-21 23:27:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:22,243 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-21 23:27:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:22,245 INFO L225 Difference]: With dead ends: 28 [2024-11-21 23:27:22,245 INFO L226 Difference]: Without dead ends: 23 [2024-11-21 23:27:22,245 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-21 23:27:22,246 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-21 23:27:22,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-21 23:27:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-21 23:27:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-21 23:27:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-21 23:27:22,259 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2024-11-21 23:27:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:22,259 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-21 23:27:22,259 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-21 23:27:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-21 23:27:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:27:22,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:22,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:22,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-21 23:27:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:22,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:22,471 INFO L85 PathProgramCache]: Analyzing trace with hash -208139495, now seen corresponding path program 1 times [2024-11-21 23:27:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137499399] [2024-11-21 23:27:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:22,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:22,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-21 23:27:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:22,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:22,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:22,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:22,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137499399] [2024-11-21 23:27:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137499399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:22,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:22,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7293587] [2024-11-21 23:27:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:22,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:22,556 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 23:27:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:22,737 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-21 23:27:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 23:27:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:22,738 INFO L225 Difference]: With dead ends: 31 [2024-11-21 23:27:22,738 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:27:22,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-21 23:27:22,739 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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.2s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:22,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 23:27:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:27:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-21 23:27:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-21 23:27:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-21 23:27:22,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2024-11-21 23:27:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:22,745 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-21 23:27:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 23:27:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-21 23:27:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:27:22,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:22,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:22,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-21 23:27:22,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:22,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1693187297, now seen corresponding path program 1 times [2024-11-21 23:27:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907147141] [2024-11-21 23:27:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:22,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:22,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:22,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-21 23:27:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:23,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:23,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:23,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:23,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907147141] [2024-11-21 23:27:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907147141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663151798] [2024-11-21 23:27:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:23,033 INFO L87 Difference]: Start difference. First operand 23 states and 30 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-21 23:27:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:23,158 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-21 23:27:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:23,159 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-21 23:27:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:23,159 INFO L225 Difference]: With dead ends: 31 [2024-11-21 23:27:23,159 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:27:23,160 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-21 23:27:23,160 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-21 23:27:23,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:27:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:27:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-21 23:27:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-21 23:27:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-21 23:27:23,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2024-11-21 23:27:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:23,165 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-21 23:27:23,165 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-21 23:27:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-21 23:27:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:27:23,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:23,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:23,170 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-21 23:27:23,366 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-21 23:27:23,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:23,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1113917547, now seen corresponding path program 1 times [2024-11-21 23:27:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101329503] [2024-11-21 23:27:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:23,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:23,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:23,370 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-21 23:27:23,374 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-21 23:27:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:23,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:23,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:23,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:23,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101329503] [2024-11-21 23:27:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101329503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:23,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539177574] [2024-11-21 23:27:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:23,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:23,449 INFO L87 Difference]: Start difference. First operand 23 states and 30 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, (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-21 23:27:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:23,610 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-21 23:27:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:23,611 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, (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-21 23:27:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:23,611 INFO L225 Difference]: With dead ends: 31 [2024-11-21 23:27:23,611 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:27:23,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-21 23:27:23,612 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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.2s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:23,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 23:27:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:27:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-21 23:27:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-21 23:27:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-21 23:27:23,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2024-11-21 23:27:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-21 23:27:23,617 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, (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-21 23:27:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-21 23:27:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:27:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:23,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:23,621 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-21 23:27:23,821 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-21 23:27:23,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 628892788, now seen corresponding path program 1 times [2024-11-21 23:27:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:23,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406049267] [2024-11-21 23:27:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:23,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:23,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:23,826 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-21 23:27:23,827 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-21 23:27:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:23,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:27:23,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:27:23,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:23,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406049267] [2024-11-21 23:27:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406049267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:23,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754351307] [2024-11-21 23:27:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:23,988 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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-21 23:27:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:24,050 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-21 23:27:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 23:27:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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-21 23:27:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:24,051 INFO L225 Difference]: With dead ends: 28 [2024-11-21 23:27:24,051 INFO L226 Difference]: Without dead ends: 23 [2024-11-21 23:27:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:24,053 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:24,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:27:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-21 23:27:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-21 23:27:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 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-21 23:27:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-21 23:27:24,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-11-21 23:27:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-21 23:27:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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-21 23:27:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-21 23:27:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 23:27:24,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:24,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:24,061 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-21 23:27:24,261 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-21 23:27:24,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 550124328, now seen corresponding path program 1 times [2024-11-21 23:27:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542124849] [2024-11-21 23:27:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:24,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:24,266 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-21 23:27:24,267 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-21 23:27:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:24,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:24,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:24,435 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-21 23:27:24,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:24,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:24,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542124849] [2024-11-21 23:27:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542124849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:24,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:24,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629934034] [2024-11-21 23:27:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:24,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:24,437 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-21 23:27:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:24,492 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-21 23:27:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:24,493 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-21 23:27:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:24,493 INFO L225 Difference]: With dead ends: 28 [2024-11-21 23:27:24,493 INFO L226 Difference]: Without dead ends: 22 [2024-11-21 23:27:24,494 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-21 23:27:24,494 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:24,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-21 23:27:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-21 23:27:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-21 23:27:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-21 23:27:24,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 22 [2024-11-21 23:27:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:24,498 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-21 23:27:24,498 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-21 23:27:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-21 23:27:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 23:27:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:24,499 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-21 23:27:24,508 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-21 23:27:24,699 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-21 23:27:24,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -835727554, now seen corresponding path program 1 times [2024-11-21 23:27:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066019899] [2024-11-21 23:27:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:24,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:24,704 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-21 23:27:24,705 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-21 23:27:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:24,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:24,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:24,812 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-21 23:27:24,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:24,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066019899] [2024-11-21 23:27:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066019899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654872822] [2024-11-21 23:27:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:24,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:24,814 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-21 23:27:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:24,831 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-21 23:27:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-21 23:27:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:24,832 INFO L225 Difference]: With dead ends: 30 [2024-11-21 23:27:24,832 INFO L226 Difference]: Without dead ends: 24 [2024-11-21 23:27:24,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-21 23:27:24,832 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:24,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-21 23:27:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-21 23:27:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-21 23:27:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-21 23:27:24,840 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2024-11-21 23:27:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-21 23:27:24,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-21 23:27:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-21 23:27:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-21 23:27:24,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:24,844 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-21 23:27:24,855 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-21 23:27:25,044 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-21 23:27:25,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1828811108, now seen corresponding path program 1 times [2024-11-21 23:27:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597268255] [2024-11-21 23:27:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:25,048 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-21 23:27:25,049 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-21 23:27:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:25,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:25,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:25,139 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-21 23:27:25,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:25,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597268255] [2024-11-21 23:27:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597268255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:25,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020103593] [2024-11-21 23:27:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:25,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:25,140 INFO L87 Difference]: Start difference. First operand 22 states and 26 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-21 23:27:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:25,163 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-21 23:27:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:25,165 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-21 23:27:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:25,165 INFO L225 Difference]: With dead ends: 30 [2024-11-21 23:27:25,165 INFO L226 Difference]: Without dead ends: 24 [2024-11-21 23:27:25,166 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-21 23:27:25,166 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:25,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-21 23:27:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-21 23:27:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-21 23:27:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-21 23:27:25,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2024-11-21 23:27:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:25,169 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-21 23:27:25,169 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-21 23:27:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-21 23:27:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 23:27:25,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:25,170 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-21 23:27:25,175 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-21 23:27:25,374 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-21 23:27:25,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1206437754, now seen corresponding path program 1 times [2024-11-21 23:27:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388152556] [2024-11-21 23:27:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:25,377 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-21 23:27:25,379 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-21 23:27:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:25,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:25,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:25,458 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-21 23:27:25,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:25,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388152556] [2024-11-21 23:27:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388152556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259963882] [2024-11-21 23:27:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:25,460 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-21 23:27:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:25,509 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-21 23:27:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-21 23:27:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:25,510 INFO L225 Difference]: With dead ends: 30 [2024-11-21 23:27:25,510 INFO L226 Difference]: Without dead ends: 24 [2024-11-21 23:27:25,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-21 23:27:25,512 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:25,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-21 23:27:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-21 23:27:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-21 23:27:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-21 23:27:25,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2024-11-21 23:27:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-21 23:27:25,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-21 23:27:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-21 23:27:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 23:27:25,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:25,515 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-21 23:27:25,521 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 (11)] Ended with exit code 0 [2024-11-21 23:27:25,716 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-21 23:27:25,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1345719207, now seen corresponding path program 1 times [2024-11-21 23:27:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644179295] [2024-11-21 23:27:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:25,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:25,718 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-21 23:27:25,719 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-21 23:27:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:25,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:27:25,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:25,875 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-21 23:27:25,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:25,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:25,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644179295] [2024-11-21 23:27:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644179295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790130473] [2024-11-21 23:27:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:25,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:25,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:25,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:25,876 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-21 23:27:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:25,914 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-21 23:27:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 23:27:25,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 25 [2024-11-21 23:27:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:25,915 INFO L225 Difference]: With dead ends: 22 [2024-11-21 23:27:25,915 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 23:27:25,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:25,916 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:25,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 23:27:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 23:27:25,916 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-21 23:27:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 23:27:25,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-21 23:27:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:25,916 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 23:27:25,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-21 23:27:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 23:27:25,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 23:27:25,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:27:25,925 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-21 23:27:26,120 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-21 23:27:26,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:26,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 23:27:26,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:27:26,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:27:26 BoogieIcfgContainer [2024-11-21 23:27:26,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:27:26,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:27:26,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:27:26,180 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:27:26,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:21" (3/4) ... [2024-11-21 23:27:26,182 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 23:27:26,188 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-21 23:27:26,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-21 23:27:26,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-21 23:27:26,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 23:27:26,196 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 23:27:26,254 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 23:27:26,255 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 23:27:26,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:27:26,255 INFO L158 Benchmark]: Toolchain (without parser) took 5442.52ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 61.7MB in the beginning and 90.0MB in the end (delta: -28.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,255 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:26,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.07ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 47.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.57ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 45.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,256 INFO L158 Benchmark]: Boogie Preprocessor took 53.03ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,256 INFO L158 Benchmark]: RCFGBuilder took 356.76ms. Allocated memory is still 83.9MB. Free memory was 43.5MB in the beginning and 57.0MB in the end (delta: -13.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,256 INFO L158 Benchmark]: TraceAbstraction took 4656.44ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 56.5MB in the beginning and 95.2MB in the end (delta: -38.7MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,257 INFO L158 Benchmark]: Witness Printer took 76.97ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 90.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 23:27:26,258 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.72ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.07ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 47.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.57ms. Allocated memory is still 83.9MB. Free memory was 47.7MB in the beginning and 45.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.03ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.76ms. Allocated memory is still 83.9MB. Free memory was 43.5MB in the beginning and 57.0MB in the end (delta: -13.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4656.44ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 56.5MB in the beginning and 95.2MB in the end (delta: -38.7MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 76.97ms. Allocated memory is still 123.7MB. Free memory was 95.2MB in the beginning and 90.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 74]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 285 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 8 QuantifiedInterpolants, 304 SizeOfPredicates, 2 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 30/30 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: 31]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-21 23:27:26,275 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 Writing output log to file Ultimate.log Result: TRUE