./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_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 b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:31:34,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:31:34,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 17:31:34,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:31:34,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:31:34,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:31:34,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:31:34,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:31:34,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:31:34,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:31:34,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:31:34,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:31:34,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:31:34,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:31:34,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:31:34,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:31:34,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:31:34,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:31:34,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 17:31:34,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:31:34,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:31:34,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:31:34,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:31:34,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:31:34,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:31:34,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:31:34,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:31:34,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:31:34,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:31:34,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:31:34,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:31:34,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:31:34,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:31:34,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:31:34,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:31:34,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:31:34,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 17:31:34,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 17:31:34,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:31:34,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:31:34,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:31:34,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:31:34,772 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 -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2024-10-12 17:31:35,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:31:35,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:31:35,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:31:35,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:31:35,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:31:35,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-10-12 17:31:36,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:31:36,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:31:36,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-10-12 17:31:36,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a299dcab9/e950aa684105475cb4940981127d7eb6/FLAGa43f99cf3 [2024-10-12 17:31:36,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a299dcab9/e950aa684105475cb4940981127d7eb6 [2024-10-12 17:31:36,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:31:36,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:31:36,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:31:36,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:31:36,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:31:36,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:31:36" (1/1) ... [2024-10-12 17:31:36,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154fb7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:36, skipping insertion in model container [2024-10-12 17:31:36,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:31:36" (1/1) ... [2024-10-12 17:31:36,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:31:36,972 WARN L248 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/float_req_bl_1250.c[1719,1732] [2024-10-12 17:31:36,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:31:36,985 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:31:37,005 WARN L248 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/float_req_bl_1250.c[1719,1732] [2024-10-12 17:31:37,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:31:37,024 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:31:37,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37 WrapperNode [2024-10-12 17:31:37,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:31:37,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:31:37,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:31:37,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:31:37,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,068 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-12 17:31:37,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:31:37,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:31:37,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:31:37,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:31:37,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,115 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 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-10-12 17:31:37,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:31:37,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:31:37,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:31:37,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:31:37,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (1/1) ... [2024-10-12 17:31:37,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:31:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:31:37,173 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-10-12 17:31:37,176 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-10-12 17:31:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:31:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 17:31:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 17:31:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:31:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-12 17:31:37,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-12 17:31:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-12 17:31:37,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-12 17:31:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:31:37,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:31:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 17:31:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 17:31:37,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:31:37,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:31:37,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:31:37,522 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 17:31:37,523 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:31:37,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:31:37,560 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 17:31:37,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:37 BoogieIcfgContainer [2024-10-12 17:31:37,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:31:37,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:31:37,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:31:37,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:31:37,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:31:36" (1/3) ... [2024-10-12 17:31:37,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3422401f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:31:37, skipping insertion in model container [2024-10-12 17:31:37,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:37" (2/3) ... [2024-10-12 17:31:37,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3422401f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:31:37, skipping insertion in model container [2024-10-12 17:31:37,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:37" (3/3) ... [2024-10-12 17:31:37,571 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2024-10-12 17:31:37,590 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:31:37,590 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:31:37,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:31:37,657 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;@31ca41d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:31:37,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:31:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:31:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 17:31:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:37,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:37,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:37,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1078953639, now seen corresponding path program 1 times [2024-10-12 17:31:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988975908] [2024-10-12 17:31:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:31:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:31:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988975908] [2024-10-12 17:31:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988975908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:37,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:31:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748544557] [2024-10-12 17:31:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 17:31:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:31:37,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 17:31:37,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:31:37,898 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-12 17:31:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:37,949 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2024-10-12 17:31:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 17:31:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-10-12 17:31:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:37,958 INFO L225 Difference]: With dead ends: 42 [2024-10-12 17:31:37,958 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 17:31:37,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:31:37,963 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:37,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 17:31:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 17:31:37,998 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-10-12 17:31:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-12 17:31:38,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2024-10-12 17:31:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 17:31:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-12 17:31:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-10-12 17:31:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 17:31:38,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:38,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:38,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 17:31:38,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:38,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash -988491113, now seen corresponding path program 1 times [2024-10-12 17:31:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:38,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760887005] [2024-10-12 17:31:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:31:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:31:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760887005] [2024-10-12 17:31:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760887005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339730860] [2024-10-12 17:31:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:31:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,319 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-10-12 17:31:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:38,365 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-12 17:31:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-10-12 17:31:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:38,367 INFO L225 Difference]: With dead ends: 28 [2024-10-12 17:31:38,368 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 17:31:38,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,371 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:38,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 17:31:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 17:31:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-12 17:31:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 17:31:38,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-12 17:31:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:38,385 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 17:31:38,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-10-12 17:31:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 17:31:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 17:31:38,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:38,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 17:31:38,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1541792886, now seen corresponding path program 1 times [2024-10-12 17:31:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784955304] [2024-10-12 17:31:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:31:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:31:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784955304] [2024-10-12 17:31:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784955304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061873227] [2024-10-12 17:31:38,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:31:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:38,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,536 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-10-12 17:31:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:38,576 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-12 17:31:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-10-12 17:31:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:38,578 INFO L225 Difference]: With dead ends: 32 [2024-10-12 17:31:38,578 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 17:31:38,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,582 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 17:31:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-12 17:31:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-12 17:31:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 17:31:38,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2024-10-12 17:31:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:38,593 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 17:31:38,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-10-12 17:31:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 17:31:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 17:31:38,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:38,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 17:31:38,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:38,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1052492275, now seen corresponding path program 1 times [2024-10-12 17:31:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124469212] [2024-10-12 17:31:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:31:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:31:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124469212] [2024-10-12 17:31:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124469212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458524069] [2024-10-12 17:31:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:31:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,766 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:31:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:38,816 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-12 17:31:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:38,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 17:31:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:38,818 INFO L225 Difference]: With dead ends: 32 [2024-10-12 17:31:38,818 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 17:31:38,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,819 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:38,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 17:31:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-12 17:31:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-12 17:31:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 17:31:38,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-10-12 17:31:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 17:31:38,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:31:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 17:31:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 17:31:38,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:38,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:38,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 17:31:38,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:38,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1445349266, now seen corresponding path program 1 times [2024-10-12 17:31:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896596583] [2024-10-12 17:31:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:31:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:31:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896596583] [2024-10-12 17:31:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896596583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:38,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532173529] [2024-10-12 17:31:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:31:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:38,970 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:31:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:39,008 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-12 17:31:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:39,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 17:31:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:39,010 INFO L225 Difference]: With dead ends: 32 [2024-10-12 17:31:39,010 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 17:31:39,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:39,011 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:39,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 17:31:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-12 17:31:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-12 17:31:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 17:31:39,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2024-10-12 17:31:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 17:31:39,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:31:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 17:31:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 17:31:39,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:39,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 17:31:39,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1106807695, now seen corresponding path program 1 times [2024-10-12 17:31:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:31:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310902734] [2024-10-12 17:31:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:31:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:31:39,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 17:31:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:31:39,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 17:31:39,078 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 17:31:39,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:31:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 17:31:39,084 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 17:31:39,104 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:31:39,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:31:39 BoogieIcfgContainer [2024-10-12 17:31:39,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:31:39,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:31:39,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:31:39,113 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:31:39,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:37" (3/4) ... [2024-10-12 17:31:39,115 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 17:31:39,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:31:39,117 INFO L158 Benchmark]: Toolchain (without parser) took 2358.62ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 79.0MB in the beginning and 114.2MB in the end (delta: -35.2MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-10-12 17:31:39,117 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 99.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:31:39,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.84ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 66.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 17:31:39,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.95ms. Allocated memory is still 151.0MB. Free memory was 66.2MB in the beginning and 64.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:31:39,120 INFO L158 Benchmark]: Boogie Preprocessor took 59.62ms. Allocated memory is still 151.0MB. Free memory was 64.7MB in the beginning and 119.4MB in the end (delta: -54.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-12 17:31:39,120 INFO L158 Benchmark]: RCFGBuilder took 430.78ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 119.3MB in the beginning and 174.8MB in the end (delta: -55.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 17:31:39,120 INFO L158 Benchmark]: TraceAbstraction took 1546.65ms. Allocated memory is still 216.0MB. Free memory was 173.8MB in the beginning and 114.2MB in the end (delta: 59.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2024-10-12 17:31:39,121 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 216.0MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:31:39,122 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.19ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 99.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.84ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 66.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.95ms. Allocated memory is still 151.0MB. Free memory was 66.2MB in the beginning and 64.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.62ms. Allocated memory is still 151.0MB. Free memory was 64.7MB in the beginning and 119.4MB in the end (delta: -54.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 430.78ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 119.3MB in the beginning and 174.8MB in the end (delta: -55.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1546.65ms. Allocated memory is still 216.0MB. Free memory was 173.8MB in the beginning and 114.2MB in the end (delta: 59.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 216.0MB. Free memory is still 114.2MB. 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: 67]: 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 someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L62] float x = 0.0f / 0.0f; [L63] float y = 0.0f / 0.0f; [L64] CALL, EXPR fmax_float(x, y) [L45] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095050] [L22] __uint32_t w; VAL [\old(x)=2139095050, x=2139095050] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (w) = gf_u.word [L30] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L32-L33] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L35-L36] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L38] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L41] return 0; VAL [\old(x)=2139095050, \result=0, x=2139095050] [L45] RET, EXPR __fpclassify_float(x) VAL [x=2139095050] [L45] COND TRUE __fpclassify_float(x) == 0 [L46] return y; VAL [\result=2139095051, x=2139095050] [L64] RET, EXPR fmax_float(x, y) [L64] float res = fmax_float(x, y); [L66] CALL, EXPR isnan_float(res) [L56] return x != x; [L66] RET, EXPR isnan_float(res) [L66] COND TRUE !isnan_float(res) [L67] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 123 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 157 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-10-12 17:31:39,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_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 b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:31:41,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:31:41,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 17:31:41,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:31:41,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:31:41,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:31:41,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:31:41,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:31:41,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:31:41,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:31:41,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:31:41,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:31:41,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:31:41,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:31:41,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:31:41,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:31:41,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:31:41,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:31:41,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:31:41,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:31:41,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:31:41,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:31:41,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:31:41,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 17:31:41,430 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 17:31:41,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:31:41,431 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 17:31:41,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:31:41,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:31:41,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:31:41,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:31:41,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:31:41,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:31:41,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:31:41,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:31:41,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:31:41,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:31:41,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:31:41,435 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 17:31:41,436 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 17:31:41,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:31:41,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:31:41,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:31:41,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:31:41,437 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 17:31:41,437 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 -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2024-10-12 17:31:41,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:31:41,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:31:41,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:31:41,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:31:41,819 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:31:41,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-10-12 17:31:43,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:31:43,568 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:31:43,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-10-12 17:31:43,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1f6a0dd/5ad84623c7234ed28bf2e5984df14f3c/FLAGaa996e708 [2024-10-12 17:31:43,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1f6a0dd/5ad84623c7234ed28bf2e5984df14f3c [2024-10-12 17:31:43,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:31:43,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:31:43,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:31:43,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:31:43,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:31:43,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa263b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43, skipping insertion in model container [2024-10-12 17:31:43,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:31:43,820 WARN L248 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/float_req_bl_1250.c[1719,1732] [2024-10-12 17:31:43,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:31:43,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:31:43,862 WARN L248 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/float_req_bl_1250.c[1719,1732] [2024-10-12 17:31:43,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:31:43,882 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:31:43,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43 WrapperNode [2024-10-12 17:31:43,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:31:43,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:31:43,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:31:43,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:31:43,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,921 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-10-12 17:31:43,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:31:43,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:31:43,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:31:43,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:31:43,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,959 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 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-10-12 17:31:43,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:43,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:31:43,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:31:43,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:31:43,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:31:43,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (1/1) ... [2024-10-12 17:31:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:31:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:31:44,029 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-10-12 17:31:44,035 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-10-12 17:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 17:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 17:31:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-12 17:31:44,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-12 17:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-12 17:31:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-12 17:31:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:31:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:31:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-12 17:31:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-12 17:31:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:31:44,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:31:44,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:31:44,368 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 17:31:44,368 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:31:44,399 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:31:44,403 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 17:31:44,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:44 BoogieIcfgContainer [2024-10-12 17:31:44,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:31:44,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:31:44,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:31:44,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:31:44,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:31:43" (1/3) ... [2024-10-12 17:31:44,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:31:44, skipping insertion in model container [2024-10-12 17:31:44,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:31:43" (2/3) ... [2024-10-12 17:31:44,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:31:44, skipping insertion in model container [2024-10-12 17:31:44,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:44" (3/3) ... [2024-10-12 17:31:44,412 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2024-10-12 17:31:44,426 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:31:44,427 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:31:44,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:31:44,476 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;@68913de5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:31:44,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:31:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-10-12 17:31:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 17:31:44,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:44,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:44,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2108866882, now seen corresponding path program 1 times [2024-10-12 17:31:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538974355] [2024-10-12 17:31:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:44,512 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-10-12 17:31:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:44,515 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-10-12 17:31:44,516 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-10-12 17:31:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:44,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 17:31:44,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:44,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:44,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538974355] [2024-10-12 17:31:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538974355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:44,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:31:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876520766] [2024-10-12 17:31:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:31:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:31:44,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:31:44,647 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-12 17:31:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:44,680 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2024-10-12 17:31:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:31:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 11 [2024-10-12 17:31:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:44,690 INFO L225 Difference]: With dead ends: 38 [2024-10-12 17:31:44,690 INFO L226 Difference]: Without dead ends: 18 [2024-10-12 17:31:44,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-10-12 17:31:44,697 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:44,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-12 17:31:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 17:31:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-10-12 17:31:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-12 17:31:44,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2024-10-12 17:31:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:44,734 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 17:31:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-12 17:31:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-10-12 17:31:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 17:31:44,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:44,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:44,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-12 17:31:44,936 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-10-12 17:31:44,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1853619590, now seen corresponding path program 1 times [2024-10-12 17:31:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:44,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874710207] [2024-10-12 17:31:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:44,941 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-10-12 17:31:44,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:44,944 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-10-12 17:31:44,946 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-10-12 17:31:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:45,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:45,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:45,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:45,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874710207] [2024-10-12 17:31:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874710207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:45,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:45,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:45,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086111637] [2024-10-12 17:31:45,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:45,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:45,059 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-12 17:31:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:45,088 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-12 17:31:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:45,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-12 17:31:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:45,091 INFO L225 Difference]: With dead ends: 25 [2024-10-12 17:31:45,091 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 17:31:45,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-12 17:31:45,092 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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-10-12 17:31:45,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 17:31:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-12 17:31:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:31:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-12 17:31:45,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2024-10-12 17:31:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:45,103 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 17:31:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-12 17:31:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-12 17:31:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 17:31:45,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:45,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:45,112 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-10-12 17:31:45,304 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-10-12 17:31:45,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:45,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1218730299, now seen corresponding path program 1 times [2024-10-12 17:31:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747970734] [2024-10-12 17:31:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:45,307 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-10-12 17:31:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:45,310 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-10-12 17:31:45,312 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-10-12 17:31:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:45,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:45,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:45,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:45,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747970734] [2024-10-12 17:31:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747970734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478157068] [2024-10-12 17:31:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:45,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:45,403 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-12 17:31:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:45,434 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-12 17:31:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:45,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-12 17:31:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:45,436 INFO L225 Difference]: With dead ends: 28 [2024-10-12 17:31:45,437 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 17:31:45,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-10-12 17:31:45,439 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:45,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 17:31:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-12 17:31:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:31:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-12 17:31:45,451 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 13 [2024-10-12 17:31:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:45,452 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 17:31:45,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-10-12 17:31:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-12 17:31:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 17:31:45,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:45,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:45,459 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-10-12 17:31:45,655 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-10-12 17:31:45,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:45,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1577718378, now seen corresponding path program 1 times [2024-10-12 17:31:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307820362] [2024-10-12 17:31:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:45,657 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-10-12 17:31:45,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:45,659 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-10-12 17:31:45,679 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-10-12 17:31:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:45,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:45,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:45,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:45,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307820362] [2024-10-12 17:31:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307820362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814757144] [2024-10-12 17:31:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:45,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:45,761 INFO L87 Difference]: Start difference. First operand 21 states and 28 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-10-12 17:31:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:45,799 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-12 17:31:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:45,801 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-10-12 17:31:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:45,802 INFO L225 Difference]: With dead ends: 28 [2024-10-12 17:31:45,802 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 17:31:45,802 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-10-12 17:31:45,803 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:45,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 17:31:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-12 17:31:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:31:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-12 17:31:45,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 14 [2024-10-12 17:31:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 17:31:45,811 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-10-12 17:31:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-12 17:31:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 17:31:45,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:45,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:45,816 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-10-12 17:31:46,013 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-10-12 17:31:46,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1623328873, now seen corresponding path program 1 times [2024-10-12 17:31:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:46,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682432681] [2024-10-12 17:31:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:46,015 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-10-12 17:31:46,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:46,017 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-10-12 17:31:46,018 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-10-12 17:31:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:46,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:46,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:46,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:46,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682432681] [2024-10-12 17:31:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682432681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:46,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001176399] [2024-10-12 17:31:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:46,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:46,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:46,106 INFO L87 Difference]: Start difference. First operand 21 states and 28 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-10-12 17:31:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:46,137 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-12 17:31:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:46,138 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-10-12 17:31:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:46,139 INFO L225 Difference]: With dead ends: 28 [2024-10-12 17:31:46,139 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 17:31:46,140 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-10-12 17:31:46,140 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:46,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 17:31:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-12 17:31:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:31:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-12 17:31:46,147 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 15 [2024-10-12 17:31:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:46,147 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-12 17:31:46,147 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-10-12 17:31:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-12 17:31:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 17:31:46,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:46,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:46,155 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-10-12 17:31:46,353 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-10-12 17:31:46,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:46,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1784134742, now seen corresponding path program 1 times [2024-10-12 17:31:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:46,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558345592] [2024-10-12 17:31:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:31:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:46,357 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-10-12 17:31:46,357 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-10-12 17:31:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:46,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 17:31:46,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:31:46,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:46,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558345592] [2024-10-12 17:31:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558345592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640493818] [2024-10-12 17:31:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:46,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:46,536 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (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-10-12 17:31:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:46,587 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-12 17:31:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (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-10-12 17:31:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:46,589 INFO L225 Difference]: With dead ends: 25 [2024-10-12 17:31:46,590 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 17:31:46,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:46,592 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:46,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 17:31:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-12 17:31:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-10-12 17:31:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-12 17:31:46,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2024-10-12 17:31:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:46,599 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 17:31:46,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (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-10-12 17:31:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-12 17:31:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 17:31:46,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:46,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:46,607 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-10-12 17:31:46,803 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-10-12 17:31:46,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1066713348, now seen corresponding path program 1 times [2024-10-12 17:31:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467565237] [2024-10-12 17:31:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:46,805 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-10-12 17:31:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:46,807 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-10-12 17:31:46,808 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-10-12 17:31:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:46,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:46,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:31:46,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:46,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467565237] [2024-10-12 17:31:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467565237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953002809] [2024-10-12 17:31:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:46,893 INFO L87 Difference]: Start difference. First operand 18 states and 22 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, (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-10-12 17:31:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:46,918 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-12 17:31:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:46,919 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, (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 20 [2024-10-12 17:31:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:46,920 INFO L225 Difference]: With dead ends: 25 [2024-10-12 17:31:46,920 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 17:31:46,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-10-12 17:31:46,921 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:46,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 17:31:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 17:31:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-10-12 17:31:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 17:31:46,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 20 [2024-10-12 17:31:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:46,926 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 17:31:46,926 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, (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-10-12 17:31:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 17:31:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 17:31:46,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:46,927 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:46,932 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-10-12 17:31:47,127 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-10-12 17:31:47,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:47,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash 96206335, now seen corresponding path program 1 times [2024-10-12 17:31:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:47,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206490714] [2024-10-12 17:31:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:47,129 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-10-12 17:31:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:47,132 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-10-12 17:31:47,133 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-10-12 17:31:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:47,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:47,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:31:47,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:47,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206490714] [2024-10-12 17:31:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206490714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344001225] [2024-10-12 17:31:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:47,209 INFO L87 Difference]: Start difference. First operand 20 states and 24 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, (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-10-12 17:31:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:47,226 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-12 17:31:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:47,226 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, (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 21 [2024-10-12 17:31:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:47,227 INFO L225 Difference]: With dead ends: 27 [2024-10-12 17:31:47,227 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 17:31:47,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-10-12 17:31:47,228 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:47,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 17:31:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-12 17:31:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-10-12 17:31:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 17:31:47,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 21 [2024-10-12 17:31:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:47,232 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 17:31:47,232 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, (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-10-12 17:31:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 17:31:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 17:31:47,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:47,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:47,240 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-10-12 17:31:47,435 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-10-12 17:31:47,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -669692568, now seen corresponding path program 1 times [2024-10-12 17:31:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576848375] [2024-10-12 17:31:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:47,437 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-10-12 17:31:47,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:47,438 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-10-12 17:31:47,440 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-10-12 17:31:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:47,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:47,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:31:47,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:47,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576848375] [2024-10-12 17:31:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576848375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789257038] [2024-10-12 17:31:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:47,528 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-10-12 17:31:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:47,549 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-12 17:31:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:47,549 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-10-12 17:31:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:47,550 INFO L225 Difference]: With dead ends: 27 [2024-10-12 17:31:47,550 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 17:31:47,550 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-10-12 17:31:47,551 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:47,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 17:31:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-12 17:31:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-10-12 17:31:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 17:31:47,561 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2024-10-12 17:31:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:47,561 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 17:31:47,561 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-10-12 17:31:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 17:31:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 17:31:47,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:47,562 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-10-12 17:31:47,568 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 (10)] Ended with exit code 0 [2024-10-12 17:31:47,762 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-10-12 17:31:47,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 612292643, now seen corresponding path program 1 times [2024-10-12 17:31:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:47,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202398929] [2024-10-12 17:31:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:47,764 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-10-12 17:31:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:47,765 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-10-12 17:31:47,767 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-10-12 17:31:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:47,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:31:47,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:31:47,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:47,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202398929] [2024-10-12 17:31:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202398929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:31:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711417971] [2024-10-12 17:31:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:47,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:31:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:31:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:31:47,850 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-10-12 17:31:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:47,867 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-12 17:31:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:31:47,868 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-10-12 17:31:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:47,869 INFO L225 Difference]: With dead ends: 27 [2024-10-12 17:31:47,869 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 17:31:47,869 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-10-12 17:31:47,870 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:47,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 17:31:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-12 17:31:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-10-12 17:31:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 17:31:47,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-10-12 17:31:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 17:31:47,875 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-10-12 17:31:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-12 17:31:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 17:31:47,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:31:47,876 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-10-12 17:31:47,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-12 17:31:48,076 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-10-12 17:31:48,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:31:48,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:31:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1499796324, now seen corresponding path program 1 times [2024-10-12 17:31:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:31:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243318878] [2024-10-12 17:31:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:31:48,078 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-10-12 17:31:48,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:31:48,079 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-10-12 17:31:48,080 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-10-12 17:31:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:31:48,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 17:31:48,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:31:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 17:31:48,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:31:48,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:31:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243318878] [2024-10-12 17:31:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243318878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:31:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:31:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:31:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502958634] [2024-10-12 17:31:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:31:48,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:31:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:31:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:31:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:48,222 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-12 17:31:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:31:48,246 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-12 17:31:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:31:48,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 23 [2024-10-12 17:31:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:31:48,248 INFO L225 Difference]: With dead ends: 20 [2024-10-12 17:31:48,249 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 17:31:48,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:31:48,249 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:31:48,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:31:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 17:31:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 17:31:48,250 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-10-12 17:31:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 17:31:48,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-10-12 17:31:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:31:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 17:31:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-12 17:31:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 17:31:48,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 17:31:48,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:31:48,259 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-10-12 17:31:48,454 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-10-12 17:31:48,457 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:31:48,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 17:31:48,495 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:31:48,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:31:48 BoogieIcfgContainer [2024-10-12 17:31:48,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:31:48,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:31:48,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:31:48,507 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:31:48,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:44" (3/4) ... [2024-10-12 17:31:48,510 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 17:31:48,514 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-10-12 17:31:48,518 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-12 17:31:48,518 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 17:31:48,518 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 17:31:48,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 17:31:48,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 17:31:48,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 17:31:48,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:31:48,602 INFO L158 Benchmark]: Toolchain (without parser) took 5011.76ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 31.2MB in the end (delta: 2.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,602 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:31:48,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.97ms. Allocated memory is still 67.1MB. Free memory was 33.2MB in the beginning and 36.0MB in the end (delta: -2.8MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.20ms. Allocated memory is still 67.1MB. Free memory was 36.0MB in the beginning and 34.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:31:48,603 INFO L158 Benchmark]: Boogie Preprocessor took 69.43ms. Allocated memory is still 67.1MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,603 INFO L158 Benchmark]: RCFGBuilder took 410.47ms. Allocated memory is still 67.1MB. Free memory was 32.1MB in the beginning and 37.0MB in the end (delta: -5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,604 INFO L158 Benchmark]: TraceAbstraction took 4101.02ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 36.5MB in the beginning and 36.0MB in the end (delta: 495.6kB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,605 INFO L158 Benchmark]: Witness Printer took 94.22ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 31.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 17:31:48,606 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.97ms. Allocated memory is still 67.1MB. Free memory was 33.2MB in the beginning and 36.0MB in the end (delta: -2.8MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.20ms. Allocated memory is still 67.1MB. Free memory was 36.0MB in the beginning and 34.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.43ms. Allocated memory is still 67.1MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 410.47ms. Allocated memory is still 67.1MB. Free memory was 32.1MB in the beginning and 37.0MB in the end (delta: -5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4101.02ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 36.5MB in the beginning and 36.0MB in the end (delta: 495.6kB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 94.22ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 31.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 67]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 242 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, InterpolantAutomatonStates: 44, 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.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 178 ConstructedInterpolants, 8 QuantifiedInterpolants, 278 SizeOfPredicates, 2 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 33 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: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-12 17:31:48,643 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