./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_1230.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_1230.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 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:58:58,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:58:58,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:58:58,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:58:58,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:58:58,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:58:58,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:58:58,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:58:58,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:58:58,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:58:58,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:58:58,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:58:58,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:58:58,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:58:58,219 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:58:58,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:58:58,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:58:58,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:58:58,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:58:58,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:58:58,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:58:58,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:58:58,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:58:58,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:58:58,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:58:58,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:58:58,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:58:58,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:58:58,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:58:58,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:58:58,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:58:58,228 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 -> 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 [2024-10-14 00:58:58,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:58:58,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:58:58,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:58:58,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:58:58,459 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:58:58,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2024-10-14 00:58:59,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:58:59,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:58:59,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2024-10-14 00:58:59,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c2df8ea/83f6bae08cd54b3ca0c9416fc911745b/FLAG7a68e168a [2024-10-14 00:58:59,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c2df8ea/83f6bae08cd54b3ca0c9416fc911745b [2024-10-14 00:58:59,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:58:59,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:58:59,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:58:59,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:58:59,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:58:59,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:59" (1/1) ... [2024-10-14 00:58:59,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae66c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:59, skipping insertion in model container [2024-10-14 00:58:59,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:59" (1/1) ... [2024-10-14 00:58:59,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:58:59,987 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_1230.c[1411,1424] [2024-10-14 00:58:59,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:59:00,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:59:00,026 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_1230.c[1411,1424] [2024-10-14 00:59:00,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:59:00,041 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:59:00,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00 WrapperNode [2024-10-14 00:59:00,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:59:00,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:59:00,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:59:00,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:59:00,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,071 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-14 00:59:00,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:59:00,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:59:00,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:59:00,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:59:00,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,090 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-14 00:59:00,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:59:00,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:59:00,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:59:00,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:59:00,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (1/1) ... [2024-10-14 00:59:00,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:59:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:59:00,126 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-14 00:59:00,128 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-14 00:59:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:59:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:59:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 00:59:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:59:00,162 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-14 00:59:00,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-14 00:59:00,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 00:59:00,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 00:59:00,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:59:00,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:59:00,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 00:59:00,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 00:59:00,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:59:00,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:59:00,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:59:00,424 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 00:59:00,424 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:59:00,446 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:59:00,447 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 00:59:00,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:00 BoogieIcfgContainer [2024-10-14 00:59:00,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:59:00,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:59:00,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:59:00,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:59:00,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:58:59" (1/3) ... [2024-10-14 00:59:00,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0bf664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:59:00, skipping insertion in model container [2024-10-14 00:59:00,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:00" (2/3) ... [2024-10-14 00:59:00,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0bf664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:59:00, skipping insertion in model container [2024-10-14 00:59:00,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:00" (3/3) ... [2024-10-14 00:59:00,453 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2024-10-14 00:59:00,466 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:59:00,466 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:59:00,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:59:00,509 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;@358de37e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:59:00,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:59:00,513 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-14 00:59:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:59:00,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:00,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:00,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:00,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1078953639, now seen corresponding path program 1 times [2024-10-14 00:59:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355535113] [2024-10-14 00:59:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:59:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:00,671 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-14 00:59:00,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:59:00,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355535113] [2024-10-14 00:59:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355535113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:00,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:00,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:59:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544702898] [2024-10-14 00:59:00,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:59:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:59:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:59:00,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:59:00,698 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-14 00:59:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:00,722 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2024-10-14 00:59:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:59:00,724 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-14 00:59:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:00,728 INFO L225 Difference]: With dead ends: 42 [2024-10-14 00:59:00,728 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 00:59:00,730 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-14 00:59:00,732 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-14 00:59:00,734 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-14 00:59:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 00:59:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 00:59:00,755 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-14 00:59:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-14 00:59:00,756 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2024-10-14 00:59:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:00,757 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-14 00:59:00,757 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-14 00:59:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-10-14 00:59:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:59:00,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:00,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:00,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:59:00,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:00,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash -988491113, now seen corresponding path program 1 times [2024-10-14 00:59:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:00,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173699150] [2024-10-14 00:59:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:59:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:00,943 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-14 00:59:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:59:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173699150] [2024-10-14 00:59:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173699150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:00,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154895733] [2024-10-14 00:59:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:59:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:00,949 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-14 00:59:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:00,990 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-14 00:59:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:00,991 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-14 00:59:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:00,993 INFO L225 Difference]: With dead ends: 28 [2024-10-14 00:59:00,993 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:59:00,995 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-14 00:59:00,996 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-14 00:59:00,996 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-14 00:59:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:59:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 00:59:01,002 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-14 00:59:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:59:01,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-14 00:59:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:01,003 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:59:01,003 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-14 00:59:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:59:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:59:01,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:01,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:59:01,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:01,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1541792886, now seen corresponding path program 1 times [2024-10-14 00:59:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051270294] [2024-10-14 00:59:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:59:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,106 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-14 00:59:01,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:59:01,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051270294] [2024-10-14 00:59:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051270294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495412555] [2024-10-14 00:59:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:01,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:59:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:01,108 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-14 00:59:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:01,128 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-14 00:59:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:01,129 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-14 00:59:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:01,129 INFO L225 Difference]: With dead ends: 32 [2024-10-14 00:59:01,129 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:59:01,130 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-14 00:59:01,131 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-14 00:59:01,131 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-14 00:59:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:59:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-14 00:59:01,134 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-14 00:59:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:59:01,135 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2024-10-14 00:59:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:01,135 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:59:01,135 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-14 00:59:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:59:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:59:01,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:01,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:59:01,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1052492275, now seen corresponding path program 1 times [2024-10-14 00:59:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:01,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137867021] [2024-10-14 00:59:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:59:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,235 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-14 00:59:01,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:59:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137867021] [2024-10-14 00:59:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137867021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:01,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685761585] [2024-10-14 00:59:01,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:01,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:01,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:59:01,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:01,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:01,237 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-14 00:59:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:01,265 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-14 00:59:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:01,265 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-14 00:59:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:01,267 INFO L225 Difference]: With dead ends: 32 [2024-10-14 00:59:01,267 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:59:01,267 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-14 00:59:01,270 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-14 00:59:01,270 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-14 00:59:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:59:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-14 00:59:01,275 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-14 00:59:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:59:01,276 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-10-14 00:59:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:01,276 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:59:01,276 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-14 00:59:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:59:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:59:01,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:01,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:01,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:59:01,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:01,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1445349266, now seen corresponding path program 1 times [2024-10-14 00:59:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125108758] [2024-10-14 00:59:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:59:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:01,371 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-14 00:59:01,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:59:01,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125108758] [2024-10-14 00:59:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125108758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220994816] [2024-10-14 00:59:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:59:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:01,374 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-14 00:59:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:01,415 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-14 00:59:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:01,416 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-14 00:59:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:01,416 INFO L225 Difference]: With dead ends: 32 [2024-10-14 00:59:01,416 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:59:01,417 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-14 00:59:01,417 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-14 00:59:01,418 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-14 00:59:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:59:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-14 00:59:01,425 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-14 00:59:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:59:01,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2024-10-14 00:59:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:01,427 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:59:01,428 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-14 00:59:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:59:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:59:01,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:01,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:59:01,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1106807695, now seen corresponding path program 1 times [2024-10-14 00:59:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:59:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960655139] [2024-10-14 00:59:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:59:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:59:01,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 00:59:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:59:01,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 00:59:01,474 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 00:59:01,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:59:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:59:01,478 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 00:59:01,494 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:59:01,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:59:01 BoogieIcfgContainer [2024-10-14 00:59:01,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:59:01,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:59:01,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:59:01,499 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:59:01,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:00" (3/4) ... [2024-10-14 00:59:01,503 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 00:59:01,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:59:01,505 INFO L158 Benchmark]: Toolchain (without parser) took 1674.65ms. Allocated memory is still 163.6MB. Free memory was 128.2MB in the beginning and 125.7MB in the end (delta: 2.5MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,505 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.87ms. Allocated memory is still 163.6MB. Free memory was 128.2MB in the beginning and 114.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.01ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 113.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: Boogie Preprocessor took 25.80ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: RCFGBuilder took 348.68ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 131.7MB in the end (delta: -20.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: TraceAbstraction took 1049.48ms. Allocated memory is still 163.6MB. Free memory was 130.4MB in the beginning and 125.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-10-14 00:59:01,506 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 163.6MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:59:01,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.87ms. Allocated memory is still 163.6MB. Free memory was 128.2MB in the beginning and 114.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.01ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 113.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.80ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.68ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 131.7MB in the end (delta: -20.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1049.48ms. Allocated memory is still 163.6MB. Free memory was 130.4MB in the beginning and 125.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 163.6MB. Free memory is still 125.7MB. 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: 61]: 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 46, overapproximation of someBinaryArithmeticFLOAToperation at line 56. Possible FailurePath: [L56] float x = 0.0f / 0.0f; [L57] float y = 0.0f / 0.0f; [L58] CALL, EXPR fmin_float(x, y) [L37] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095050] [L14] __uint32_t w; VAL [\old(x)=2139095050, x=2139095050] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (w) = gf_u.word [L22] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L24-L25] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L27-L28] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095050, w=2139095041, x=2139095050] [L30] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L33] return 0; VAL [\old(x)=2139095050, \result=0, x=2139095050] [L37] RET, EXPR __fpclassify_float(x) VAL [x=2139095050] [L37] COND TRUE __fpclassify_float(x) == 0 [L38] return y; VAL [\result=2139095051, x=2139095050] [L58] RET, EXPR fmin_float(x, y) [L58] float res = fmin_float(x, y); [L60] CALL, EXPR isnan_float(res) [L46] return x != x; [L60] RET, EXPR isnan_float(res) [L60] COND TRUE !isnan_float(res) [L61] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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-14 00:59:01,530 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_1230.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 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:59:03,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:59:03,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 00:59:03,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:59:03,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:59:03,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:59:03,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:59:03,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:59:03,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:59:03,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:59:03,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:59:03,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:59:03,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:59:03,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:59:03,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:59:03,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:59:03,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:59:03,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:59:03,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:59:03,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:59:03,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:59:03,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:59:03,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:59:03,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 00:59:03,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:59:03,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:59:03,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:59:03,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:59:03,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:59:03,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:59:03,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:59:03,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:59:03,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:59:03,306 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 00:59:03,306 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 -> 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 [2024-10-14 00:59:03,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:59:03,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:59:03,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:59:03,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:59:03,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:59:03,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2024-10-14 00:59:04,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:59:05,016 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:59:05,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2024-10-14 00:59:05,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46df7e05b/4fa3774bb29648e8bb1d70f796338716/FLAG9f88b847f [2024-10-14 00:59:05,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46df7e05b/4fa3774bb29648e8bb1d70f796338716 [2024-10-14 00:59:05,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:59:05,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:59:05,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:59:05,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:59:05,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:59:05,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76edf79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05, skipping insertion in model container [2024-10-14 00:59:05,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:59:05,598 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_1230.c[1411,1424] [2024-10-14 00:59:05,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:59:05,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:59:05,637 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_1230.c[1411,1424] [2024-10-14 00:59:05,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:59:05,653 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:59:05,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05 WrapperNode [2024-10-14 00:59:05,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:59:05,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:59:05,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:59:05,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:59:05,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,682 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-10-14 00:59:05,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:59:05,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:59:05,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:59:05,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:59:05,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,704 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-14 00:59:05,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:59:05,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:59:05,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:59:05,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:59:05,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (1/1) ... [2024-10-14 00:59:05,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:59:05,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:59:05,757 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-14 00:59:05,760 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-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-14 00:59:05,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 00:59:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:59:05,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:59:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 00:59:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 00:59:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:59:05,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:59:05,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:59:06,021 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 00:59:06,025 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:59:06,047 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:59:06,051 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 00:59:06,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:06 BoogieIcfgContainer [2024-10-14 00:59:06,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:59:06,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:59:06,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:59:06,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:59:06,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:59:05" (1/3) ... [2024-10-14 00:59:06,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758fca44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:59:06, skipping insertion in model container [2024-10-14 00:59:06,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:59:05" (2/3) ... [2024-10-14 00:59:06,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758fca44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:59:06, skipping insertion in model container [2024-10-14 00:59:06,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:06" (3/3) ... [2024-10-14 00:59:06,062 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2024-10-14 00:59:06,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:59:06,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:59:06,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:59:06,132 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;@2f2a618c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:59:06,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:59:06,137 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-14 00:59:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 00:59:06,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:06,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:06,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:06,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2108866882, now seen corresponding path program 1 times [2024-10-14 00:59:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862685345] [2024-10-14 00:59:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:06,160 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-14 00:59:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:06,163 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-14 00:59:06,164 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-14 00:59:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:06,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 00:59:06,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:06,262 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-14 00:59:06,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:06,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862685345] [2024-10-14 00:59:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862685345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:59:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690583052] [2024-10-14 00:59:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:59:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:59:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:59:06,288 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-14 00:59:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:06,313 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2024-10-14 00:59:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:59:06,315 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-14 00:59:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:06,320 INFO L225 Difference]: With dead ends: 38 [2024-10-14 00:59:06,320 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 00:59:06,322 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-14 00:59:06,326 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-14 00:59:06,327 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-14 00:59:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 00:59:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 00:59:06,351 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-14 00:59:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-14 00:59:06,354 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2024-10-14 00:59:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-14 00:59:06,355 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-14 00:59:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-10-14 00:59:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:59:06,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:06,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:06,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 00:59:06,560 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-14 00:59:06,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1853619590, now seen corresponding path program 1 times [2024-10-14 00:59:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120397864] [2024-10-14 00:59:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:06,562 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-14 00:59:06,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:06,565 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-14 00:59:06,565 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-14 00:59:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:06,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:06,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:06,661 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-14 00:59:06,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:06,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120397864] [2024-10-14 00:59:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120397864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615469664] [2024-10-14 00:59:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:06,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:06,666 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-14 00:59:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:06,688 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-14 00:59:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:06,689 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-14 00:59:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:06,690 INFO L225 Difference]: With dead ends: 25 [2024-10-14 00:59:06,690 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 00:59:06,691 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-14 00:59:06,692 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-14 00:59:06,693 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-14 00:59:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 00:59:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 00:59:06,699 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-14 00:59:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-14 00:59:06,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2024-10-14 00:59:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:06,700 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-14 00:59:06,701 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-14 00:59:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-14 00:59:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:59:06,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:06,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:06,705 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-14 00:59:06,904 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-14 00:59:06,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1218730299, now seen corresponding path program 1 times [2024-10-14 00:59:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895667461] [2024-10-14 00:59:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:06,906 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-14 00:59:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:06,908 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-14 00:59:06,909 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-14 00:59:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:06,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:06,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:06,995 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-14 00:59:06,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:06,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895667461] [2024-10-14 00:59:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895667461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944899584] [2024-10-14 00:59:06,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:06,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:06,997 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-14 00:59:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:07,020 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-14 00:59:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:07,021 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-14 00:59:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:07,021 INFO L225 Difference]: With dead ends: 28 [2024-10-14 00:59:07,021 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:59:07,021 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-14 00:59:07,022 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-14 00:59:07,022 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-14 00:59:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:59:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-14 00:59:07,031 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-14 00:59:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-14 00:59:07,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 13 [2024-10-14 00:59:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:07,032 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-14 00:59:07,032 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-14 00:59:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-14 00:59:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:59:07,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:07,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:07,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 00:59:07,235 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-14 00:59:07,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:07,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1577718378, now seen corresponding path program 1 times [2024-10-14 00:59:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748688302] [2024-10-14 00:59:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:07,237 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-14 00:59:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:07,239 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-14 00:59:07,240 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-14 00:59:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:07,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:07,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:07,311 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-14 00:59:07,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:07,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748688302] [2024-10-14 00:59:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748688302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:07,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899714873] [2024-10-14 00:59:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:07,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:07,314 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-14 00:59:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:07,331 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-14 00:59:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:07,332 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-14 00:59:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:07,332 INFO L225 Difference]: With dead ends: 28 [2024-10-14 00:59:07,332 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:59:07,333 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-14 00:59:07,333 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-14 00:59:07,334 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-14 00:59:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:59:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-14 00:59:07,337 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-14 00:59:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-14 00:59:07,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 14 [2024-10-14 00:59:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-14 00:59:07,338 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-14 00:59:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-14 00:59:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:59:07,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:07,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:07,342 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 00:59:07,541 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-14 00:59:07,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:07,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1623328873, now seen corresponding path program 1 times [2024-10-14 00:59:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:07,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759096573] [2024-10-14 00:59:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:07,542 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-14 00:59:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:07,544 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-14 00:59:07,545 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-14 00:59:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:07,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:07,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:07,605 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-14 00:59:07,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:07,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:07,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759096573] [2024-10-14 00:59:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759096573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:07,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:07,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263296150] [2024-10-14 00:59:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:07,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:07,609 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-14 00:59:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:07,629 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-14 00:59:07,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:07,629 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-14 00:59:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:07,630 INFO L225 Difference]: With dead ends: 28 [2024-10-14 00:59:07,630 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:59:07,630 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-14 00:59:07,631 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-14 00:59:07,631 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-14 00:59:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:59:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-14 00:59:07,634 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-14 00:59:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-14 00:59:07,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 15 [2024-10-14 00:59:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:07,634 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-14 00:59:07,635 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-14 00:59:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-14 00:59:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:59:07,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:07,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:07,639 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-14 00:59:07,838 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-14 00:59:07,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1784134742, now seen corresponding path program 1 times [2024-10-14 00:59:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738550093] [2024-10-14 00:59:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:07,839 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-14 00:59:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:07,842 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-14 00:59:07,842 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-14 00:59:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:07,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 00:59:07,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:07,952 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-14 00:59:07,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:07,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738550093] [2024-10-14 00:59:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738550093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:07,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255680165] [2024-10-14 00:59:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:07,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:07,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:07,954 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-14 00:59:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:07,991 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-14 00:59:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:07,993 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-14 00:59:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:07,993 INFO L225 Difference]: With dead ends: 25 [2024-10-14 00:59:07,993 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 00:59:07,994 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-14 00:59:07,994 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-14 00:59:07,994 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-14 00:59:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 00:59:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-14 00:59:07,997 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-14 00:59:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-14 00:59:07,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2024-10-14 00:59:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:07,998 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-14 00:59:07,998 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-14 00:59:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-14 00:59:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 00:59:07,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:07,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:08,004 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 00:59:08,199 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-14 00:59:08,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1066713348, now seen corresponding path program 1 times [2024-10-14 00:59:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420000673] [2024-10-14 00:59:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:08,201 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-14 00:59:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:08,203 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-14 00:59:08,203 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-14 00:59:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:08,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:08,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:08,268 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-14 00:59:08,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:08,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420000673] [2024-10-14 00:59:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420000673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:08,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:08,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043822862] [2024-10-14 00:59:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:08,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:08,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:08,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:08,270 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-14 00:59:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:08,290 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-14 00:59:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:08,291 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-14 00:59:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:08,291 INFO L225 Difference]: With dead ends: 25 [2024-10-14 00:59:08,291 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 00:59:08,291 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-14 00:59:08,292 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-14 00:59:08,292 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-14 00:59:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 00:59:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 00:59:08,296 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-14 00:59:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 00:59:08,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 20 [2024-10-14 00:59:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 00:59:08,298 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-14 00:59:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 00:59:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:59:08,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:08,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:08,303 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 (8)] Forceful destruction successful, exit code 0 [2024-10-14 00:59:08,499 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-14 00:59:08,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 96206335, now seen corresponding path program 1 times [2024-10-14 00:59:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186529280] [2024-10-14 00:59:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:08,501 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-14 00:59:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:08,503 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-14 00:59:08,504 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-14 00:59:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:08,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:08,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:08,562 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-14 00:59:08,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:08,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186529280] [2024-10-14 00:59:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186529280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946182913] [2024-10-14 00:59:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:08,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:08,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:08,568 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-14 00:59:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:08,583 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-14 00:59:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:08,584 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-14 00:59:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:08,584 INFO L225 Difference]: With dead ends: 27 [2024-10-14 00:59:08,585 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 00:59:08,585 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-14 00:59:08,586 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-14 00:59:08,586 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-14 00:59:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 00:59:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-14 00:59:08,592 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-14 00:59:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 00:59:08,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 21 [2024-10-14 00:59:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:08,593 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 00:59:08,593 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-14 00:59:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 00:59:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 00:59:08,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:08,594 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-14 00:59:08,598 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-14 00:59:08,794 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-14 00:59:08,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:08,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash -669692568, now seen corresponding path program 1 times [2024-10-14 00:59:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:08,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485498820] [2024-10-14 00:59:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:08,796 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-14 00:59:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:08,797 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-14 00:59:08,799 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-14 00:59:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:08,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:08,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:08,857 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-14 00:59:08,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:08,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485498820] [2024-10-14 00:59:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485498820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716295257] [2024-10-14 00:59:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:08,860 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-14 00:59:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:08,879 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-14 00:59:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:08,880 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-14 00:59:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:08,880 INFO L225 Difference]: With dead ends: 27 [2024-10-14 00:59:08,880 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 00:59:08,881 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-14 00:59:08,881 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-14 00:59:08,881 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-14 00:59:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 00:59:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-14 00:59:08,883 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-14 00:59:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 00:59:08,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2024-10-14 00:59:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:08,884 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 00:59:08,884 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-14 00:59:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 00:59:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 00:59:08,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:08,884 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-14 00:59:08,889 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-14 00:59:09,085 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-14 00:59:09,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 612292643, now seen corresponding path program 1 times [2024-10-14 00:59:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517122261] [2024-10-14 00:59:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:09,087 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-14 00:59:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:09,089 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-14 00:59:09,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 00:59:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:09,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:59:09,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:09,146 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-14 00:59:09,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:09,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:09,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517122261] [2024-10-14 00:59:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517122261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:09,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:09,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:59:09,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487805319] [2024-10-14 00:59:09,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:09,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:59:09,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:09,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:59:09,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:59:09,147 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-14 00:59:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:09,164 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-14 00:59:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:59:09,164 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-14 00:59:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:09,164 INFO L225 Difference]: With dead ends: 27 [2024-10-14 00:59:09,164 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 00:59:09,165 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-14 00:59:09,165 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-14 00:59:09,165 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-14 00:59:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 00:59:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-14 00:59:09,170 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-14 00:59:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 00:59:09,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-10-14 00:59:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 00:59:09,171 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-14 00:59:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 00:59:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 00:59:09,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:59:09,171 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-14 00:59:09,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 00:59:09,372 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-14 00:59:09,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:59:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:59:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1499796324, now seen corresponding path program 1 times [2024-10-14 00:59:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:59:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16470042] [2024-10-14 00:59:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:59:09,373 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-14 00:59:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:59:09,375 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-14 00:59:09,376 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-14 00:59:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:59:09,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 00:59:09,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:59:09,469 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-14 00:59:09,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:59:09,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:59:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16470042] [2024-10-14 00:59:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16470042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:59:09,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:59:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:59:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335240153] [2024-10-14 00:59:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:59:09,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:59:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:59:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:59:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:59:09,470 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-14 00:59:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:59:09,484 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-14 00:59:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:59:09,485 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-14 00:59:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:59:09,485 INFO L225 Difference]: With dead ends: 20 [2024-10-14 00:59:09,485 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:59:09,486 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-14 00:59:09,486 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-14 00:59:09,486 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-14 00:59:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:59:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:59:09,487 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-14 00:59:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:59:09,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-10-14 00:59:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:59:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:59:09,487 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-14 00:59:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:59:09,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:59:09,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:59:09,494 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-14 00:59:09,693 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-14 00:59:09,695 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:59:09,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:59:09,731 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:59:09,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:59:09 BoogieIcfgContainer [2024-10-14 00:59:09,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:59:09,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:59:09,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:59:09,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:59:09,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:59:06" (3/4) ... [2024-10-14 00:59:09,742 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:59:09,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-10-14 00:59:09,748 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-14 00:59:09,748 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 00:59:09,749 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:59:09,749 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:59:09,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:59:09,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:59:09,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:59:09,856 INFO L158 Benchmark]: Toolchain (without parser) took 4433.38ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 68.7MB in the end (delta: -33.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,856 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:59:09,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 75.5MB. Free memory was 35.1MB in the beginning and 44.6MB in the end (delta: -9.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.85ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,857 INFO L158 Benchmark]: Boogie Preprocessor took 48.50ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,857 INFO L158 Benchmark]: RCFGBuilder took 319.08ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 66.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,858 INFO L158 Benchmark]: TraceAbstraction took 3686.58ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 46.4MB in the end (delta: 19.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,858 INFO L158 Benchmark]: Witness Printer took 115.31ms. Allocated memory is still 94.4MB. Free memory was 45.7MB in the beginning and 68.7MB in the end (delta: -23.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 00:59:09,859 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 75.5MB. Free memory was 35.1MB in the beginning and 44.6MB in the end (delta: -9.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.85ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.50ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.08ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 66.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3686.58ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 46.4MB in the end (delta: 19.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 115.31ms. Allocated memory is still 94.4MB. Free memory was 45.7MB in the beginning and 68.7MB in the end (delta: -23.0MB). 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: 61]: 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: 3.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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.1s 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.2s SatisfiabilityAnalysisTime, 0.3s 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: 16]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 00:59:09,883 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