./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:34:46,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:34:46,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 19:34:46,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:34:46,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:34:46,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:34:46,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:34:46,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:34:46,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:34:46,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:34:46,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:34:46,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:34:46,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:34:46,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:34:46,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:34:46,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:34:46,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:34:46,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:34:46,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 19:34:46,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:34:46,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:34:46,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:34:46,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:34:46,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:34:46,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:34:46,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:34:46,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:34:46,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:34:46,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:34:46,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:34:46,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:34:46,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:34:46,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:34:46,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:34:46,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:34:46,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:34:46,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 19:34:46,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 19:34:46,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:34:46,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:34:46,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:34:46,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:34:46,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2024-11-19 19:34:47,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:34:47,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:34:47,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:34:47,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:34:47,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:34:47,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-11-19 19:34:48,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:34:48,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:34:48,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-11-19 19:34:48,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ea5f055/9c7e6fe7132d43c195c0a219e7fca352/FLAGa8068c86b [2024-11-19 19:34:48,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ea5f055/9c7e6fe7132d43c195c0a219e7fca352 [2024-11-19 19:34:48,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:34:48,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:34:48,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:34:48,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:34:48,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:34:48,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:48" (1/1) ... [2024-11-19 19:34:48,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3e547a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:48, skipping insertion in model container [2024-11-19 19:34:48,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:48" (1/1) ... [2024-11-19 19:34:48,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:34:49,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c[1719,1732] [2024-11-19 19:34:49,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:34:49,080 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:34:49,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c[1719,1732] [2024-11-19 19:34:49,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:34:49,121 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:34:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49 WrapperNode [2024-11-19 19:34:49,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:34:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:34:49,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:34:49,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:34:49,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,150 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-11-19 19:34:49,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:34:49,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:34:49,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:34:49,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:34:49,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,175 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-11-19 19:34:49,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:34:49,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:34:49,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:34:49,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:34:49,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (1/1) ... [2024-11-19 19:34:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:34:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:34:49,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 19:34:49,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 19:34:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:34:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 19:34:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 19:34:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-19 19:34:49,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:34:49,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 19:34:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:34:49,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:34:49,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:34:49,468 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 19:34:49,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:34:49,481 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:34:49,481 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 19:34:49,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:49 BoogieIcfgContainer [2024-11-19 19:34:49,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:34:49,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:34:49,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:34:49,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:34:49,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:34:48" (1/3) ... [2024-11-19 19:34:49,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdebf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:49, skipping insertion in model container [2024-11-19 19:34:49,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:49" (2/3) ... [2024-11-19 19:34:49,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdebf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:49, skipping insertion in model container [2024-11-19 19:34:49,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:49" (3/3) ... [2024-11-19 19:34:49,491 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2024-11-19 19:34:49,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:34:49,506 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:34:49,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:34:49,569 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;@253a1b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:34:49,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:34:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:34:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:34:49,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:49,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:49,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -66623695, now seen corresponding path program 1 times [2024-11-19 19:34:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549940393] [2024-11-19 19:34:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:34:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:34:49,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549940393] [2024-11-19 19:34:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549940393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:49,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 19:34:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230912563] [2024-11-19 19:34:49,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:49,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 19:34:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:34:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 19:34:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:34:49,793 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:49,831 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2024-11-19 19:34:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 19:34:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:34:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:49,838 INFO L225 Difference]: With dead ends: 47 [2024-11-19 19:34:49,839 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 19:34:49,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:34:49,846 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:49,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 19:34:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 19:34:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:34:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-19 19:34:49,910 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2024-11-19 19:34:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-19 19:34:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-11-19 19:34:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:34:49,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:49,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:49,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 19:34:49,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -812579763, now seen corresponding path program 1 times [2024-11-19 19:34:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338055492] [2024-11-19 19:34:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:34:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:34:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338055492] [2024-11-19 19:34:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338055492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:34:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118910502] [2024-11-19 19:34:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:50,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:34:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:34:50,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:34:50,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,160 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:50,187 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-19 19:34:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:34:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:34:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:50,190 INFO L225 Difference]: With dead ends: 31 [2024-11-19 19:34:50,190 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:34:50,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,191 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:50,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:34:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 19:34:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:34:50,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2024-11-19 19:34:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:50,203 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:34:50,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:34:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:34:50,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:50,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:50,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 19:34:50,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:50,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1926836980, now seen corresponding path program 1 times [2024-11-19 19:34:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68780539] [2024-11-19 19:34:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:34:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:50,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:34:50,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68780539] [2024-11-19 19:34:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68780539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:50,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:34:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198374838] [2024-11-19 19:34:50,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:34:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:34:50,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:34:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,350 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:50,380 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-19 19:34:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:34:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:34:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:50,382 INFO L225 Difference]: With dead ends: 35 [2024-11-19 19:34:50,382 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:34:50,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,383 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:50,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:34:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-19 19:34:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:34:50,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2024-11-19 19:34:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:34:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:34:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:34:50,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:50,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:50,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 19:34:50,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1985440463, now seen corresponding path program 1 times [2024-11-19 19:34:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951257867] [2024-11-19 19:34:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:34:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:50,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:34:50,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951257867] [2024-11-19 19:34:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951257867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:34:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756752295] [2024-11-19 19:34:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:34:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:34:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:34:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,516 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:50,556 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-19 19:34:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:34:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:34:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:50,558 INFO L225 Difference]: With dead ends: 35 [2024-11-19 19:34:50,558 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:34:50,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,559 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:50,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:34:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-19 19:34:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:34:50,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2024-11-19 19:34:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:50,566 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:34:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:34:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:34:50,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:50,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:50,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 19:34:50,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1646840168, now seen corresponding path program 1 times [2024-11-19 19:34:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947868506] [2024-11-19 19:34:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:34:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:34:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947868506] [2024-11-19 19:34:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947868506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:50,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:50,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:34:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778755953] [2024-11-19 19:34:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:50,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:34:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:34:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:34:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,685 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:50,730 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-19 19:34:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:34:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 19:34:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:50,731 INFO L225 Difference]: With dead ends: 35 [2024-11-19 19:34:50,731 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:34:50,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:34:50,733 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:50,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:34:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-19 19:34:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:34:50,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 18 [2024-11-19 19:34:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:50,743 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:34:50,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:34:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:34:50,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:50,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 19:34:50,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 840672665, now seen corresponding path program 1 times [2024-11-19 19:34:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:34:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111476255] [2024-11-19 19:34:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:34:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:34:50,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 19:34:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:34:50,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 19:34:50,824 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 19:34:50,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:34:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 19:34:50,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 19:34:50,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:34:50,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:34:50 BoogieIcfgContainer [2024-11-19 19:34:50,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:34:50,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:34:50,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:34:50,876 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:34:50,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:49" (3/4) ... [2024-11-19 19:34:50,879 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 19:34:50,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:34:50,880 INFO L158 Benchmark]: Toolchain (without parser) took 1977.04ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 115.8MB in the beginning and 216.8MB in the end (delta: -101.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:34:50,880 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:34:50,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.64ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 156.9MB in the end (delta: -41.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-19 19:34:50,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 184.5MB. Free memory was 156.9MB in the beginning and 154.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:34:50,881 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 184.5MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:34:50,881 INFO L158 Benchmark]: RCFGBuilder took 295.97ms. Allocated memory is still 184.5MB. Free memory was 152.7MB in the beginning and 139.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 19:34:50,881 INFO L158 Benchmark]: TraceAbstraction took 1392.15ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 138.0MB in the beginning and 216.8MB in the end (delta: -78.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-11-19 19:34:50,882 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 249.6MB. Free memory is still 216.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:34:50,883 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.16ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.64ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 156.9MB in the end (delta: -41.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 184.5MB. Free memory was 156.9MB in the beginning and 154.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 184.5MB. Free memory was 154.8MB in the beginning and 152.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.97ms. Allocated memory is still 184.5MB. Free memory was 152.7MB in the beginning and 139.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1392.15ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 138.0MB in the beginning and 216.8MB in the end (delta: -78.8MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 249.6MB. Free memory is still 216.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 67]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L62] float x = 0.0f / 0.0f; [L63] float y = 0.0f / 0.0f; [L64] CALL, EXPR fmax_float(x, y) [L45] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578699] [L22] __uint32_t w; VAL [\old(x)=4286578699, x=4286578699] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (w) = gf_u.word [L30] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L32-L33] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L35-L36] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L38] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L41] return 0; VAL [\old(x)=4286578699, \result=0, x=4286578699] [L45] RET, EXPR __fpclassify_float(x) VAL [x=4286578699, y=4286578698] [L45] COND TRUE __fpclassify_float(x) == 0 [L46] return y; VAL [\result=4286578698, x=4286578699] [L64] RET, EXPR fmax_float(x, y) [L64] float res = fmax_float(x, y); [L66] CALL, EXPR isnan_float(res) [L56] return x != x; VAL [\result=0] [L66] RET, EXPR isnan_float(res) [L66] COND TRUE !isnan_float(res) [L67] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, 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, 456 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 145 mSDtfsCounter, 86 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=26occurred 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.6s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 19:34:50,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:34:52,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:34:52,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 19:34:52,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:34:52,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:34:52,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:34:52,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:34:52,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:34:52,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:34:52,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:34:52,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:34:52,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:34:52,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:34:52,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:34:52,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:34:52,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:34:52,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:34:52,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:34:52,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:34:52,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:34:52,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:34:52,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:34:52,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:34:52,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 19:34:52,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 19:34:52,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:34:52,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 19:34:52,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:34:52,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:34:52,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:34:52,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:34:52,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:34:52,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:34:52,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:34:52,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:34:52,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:34:52,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:34:52,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:34:53,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 19:34:53,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 19:34:53,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:34:53,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:34:53,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:34:53,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:34:53,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2024-11-19 19:34:53,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:34:53,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:34:53,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:34:53,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:34:53,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:34:53,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-11-19 19:34:54,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:34:54,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:34:54,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2024-11-19 19:34:54,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c8f181/9d4afc2a8b64410e82c1f5a13de5442d/FLAG62149bca4 [2024-11-19 19:34:54,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c8f181/9d4afc2a8b64410e82c1f5a13de5442d [2024-11-19 19:34:54,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:34:54,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:34:54,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:34:54,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:34:54,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:34:54,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:54" (1/1) ... [2024-11-19 19:34:54,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc3cd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54, skipping insertion in model container [2024-11-19 19:34:54,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:54" (1/1) ... [2024-11-19 19:34:54,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:34:55,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c[1719,1732] [2024-11-19 19:34:55,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:34:55,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:34:55,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c[1719,1732] [2024-11-19 19:34:55,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:34:55,113 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:34:55,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55 WrapperNode [2024-11-19 19:34:55,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:34:55,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:34:55,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:34:55,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:34:55,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,151 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-11-19 19:34:55,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:34:55,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:34:55,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:34:55,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:34:55,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,178 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-11-19 19:34:55,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:34:55,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:34:55,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:34:55,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:34:55,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (1/1) ... [2024-11-19 19:34:55,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:34:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:34:55,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 19:34:55,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 19:34:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:34:55,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 19:34:55,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 19:34:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:34:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-19 19:34:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:34:55,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 19:34:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:34:55,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:34:55,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:34:55,540 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 19:34:55,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:34:55,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:34:55,558 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 19:34:55,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:55 BoogieIcfgContainer [2024-11-19 19:34:55,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:34:55,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:34:55,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:34:55,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:34:55,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:34:54" (1/3) ... [2024-11-19 19:34:55,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3b831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:55, skipping insertion in model container [2024-11-19 19:34:55,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:55" (2/3) ... [2024-11-19 19:34:55,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3b831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:55, skipping insertion in model container [2024-11-19 19:34:55,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:55" (3/3) ... [2024-11-19 19:34:55,567 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2024-11-19 19:34:55,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:34:55,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:34:55,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:34:55,649 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;@3690d844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:34:55,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:34:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:34:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 19:34:55,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:55,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:55,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1452634366, now seen corresponding path program 1 times [2024-11-19 19:34:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223456891] [2024-11-19 19:34:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:55,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:55,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 19:34:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:55,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 19:34:55,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:55,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:55,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223456891] [2024-11-19 19:34:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223456891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 19:34:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480792766] [2024-11-19 19:34:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:55,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 19:34:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 19:34:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 19:34:55,818 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:55,837 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2024-11-19 19:34:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 19:34:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 19:34:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:55,845 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:34:55,845 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 19:34:55,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 19:34:55,851 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:55,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 19:34:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 19:34:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:34:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-19 19:34:55,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2024-11-19 19:34:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-19 19:34:55,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-19 19:34:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:34:55,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:55,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:55,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 19:34:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 62027172, now seen corresponding path program 1 times [2024-11-19 19:34:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559947073] [2024-11-19 19:34:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:56,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:56,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 19:34:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:56,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:56,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:56,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:56,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:56,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559947073] [2024-11-19 19:34:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559947073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:56,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481272748] [2024-11-19 19:34:56,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:56,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:56,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,219 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:56,256 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-19 19:34:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:34:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:56,263 INFO L225 Difference]: With dead ends: 28 [2024-11-19 19:34:56,264 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 19:34:56,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,265 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:56,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 19:34:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 19:34:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-19 19:34:56,278 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2024-11-19 19:34:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:56,279 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-19 19:34:56,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-19 19:34:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:34:56,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:56,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:56,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 19:34:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -371177189, now seen corresponding path program 1 times [2024-11-19 19:34:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824941976] [2024-11-19 19:34:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:56,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:56,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:56,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 19:34:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:56,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:56,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:56,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:56,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824941976] [2024-11-19 19:34:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824941976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130737255] [2024-11-19 19:34:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,565 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:56,597 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-19 19:34:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:34:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:56,598 INFO L225 Difference]: With dead ends: 31 [2024-11-19 19:34:56,598 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:34:56,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,599 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:56,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:34:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-19 19:34:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-19 19:34:56,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2024-11-19 19:34:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-19 19:34:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-19 19:34:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:34:56,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:56,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:56,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 19:34:56,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:56,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1760663552, now seen corresponding path program 1 times [2024-11-19 19:34:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780718321] [2024-11-19 19:34:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:56,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:56,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:56,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 19:34:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:56,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:56,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:56,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:56,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780718321] [2024-11-19 19:34:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780718321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068609131] [2024-11-19 19:34:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:56,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,888 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:56,906 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-19 19:34:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:56,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:34:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:56,907 INFO L225 Difference]: With dead ends: 31 [2024-11-19 19:34:56,908 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:34:56,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:56,909 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:56,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:34:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-19 19:34:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-19 19:34:56,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2024-11-19 19:34:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-19 19:34:56,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-19 19:34:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:34:56,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:56,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:56,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 19:34:57,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:57,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1804523831, now seen corresponding path program 1 times [2024-11-19 19:34:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748209673] [2024-11-19 19:34:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:57,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:57,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:57,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 19:34:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:57,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:57,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:57,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:57,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748209673] [2024-11-19 19:34:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748209673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524173955] [2024-11-19 19:34:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:57,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:57,198 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:57,218 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-19 19:34:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:57,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:34:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:57,219 INFO L225 Difference]: With dead ends: 31 [2024-11-19 19:34:57,219 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:34:57,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:57,220 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:57,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:34:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-19 19:34:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:34:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-19 19:34:57,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2024-11-19 19:34:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:57,225 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-19 19:34:57,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-19 19:34:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:34:57,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:57,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:57,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 19:34:57,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash -747633130, now seen corresponding path program 1 times [2024-11-19 19:34:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109886042] [2024-11-19 19:34:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:57,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:57,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 19:34:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:57,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:34:57,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:34:57,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:57,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109886042] [2024-11-19 19:34:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109886042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:34:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176073717] [2024-11-19 19:34:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:57,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:34:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:57,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:34:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:34:57,592 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:57,641 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-19 19:34:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:34:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:34:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:57,642 INFO L225 Difference]: With dead ends: 28 [2024-11-19 19:34:57,642 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 19:34:57,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:34:57,643 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:57,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 19:34:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-19 19:34:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:34:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-19 19:34:57,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-11-19 19:34:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:57,652 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-19 19:34:57,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:34:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-19 19:34:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 19:34:57,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:57,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:57,658 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-11-19 19:34:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1982229734, now seen corresponding path program 1 times [2024-11-19 19:34:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058674204] [2024-11-19 19:34:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:57,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:57,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:57,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:57,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 19:34:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:57,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:57,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:34:57,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:57,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058674204] [2024-11-19 19:34:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058674204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:57,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:57,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719262202] [2024-11-19 19:34:57,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:57,927 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:57,950 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-19 19:34:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 19:34:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:57,951 INFO L225 Difference]: With dead ends: 28 [2024-11-19 19:34:57,951 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 19:34:57,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:57,952 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:57,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 19:34:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 19:34:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:34:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 19:34:57,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 22 [2024-11-19 19:34:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 19:34:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-19 19:34:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 19:34:57,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:57,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:57,968 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-11-19 19:34:58,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1436544545, now seen corresponding path program 1 times [2024-11-19 19:34:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431434053] [2024-11-19 19:34:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:58,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:58,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 19:34:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:58,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:58,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:34:58,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:58,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431434053] [2024-11-19 19:34:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431434053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862067166] [2024-11-19 19:34:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:58,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:58,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,247 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:58,269 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-19 19:34:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-19 19:34:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:58,272 INFO L225 Difference]: With dead ends: 30 [2024-11-19 19:34:58,272 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:34:58,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,272 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:58,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:34:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-19 19:34:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:34:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 19:34:58,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2024-11-19 19:34:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:58,276 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 19:34:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-19 19:34:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 19:34:58,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:58,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:58,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 19:34:58,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:58,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 81479618, now seen corresponding path program 1 times [2024-11-19 19:34:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81027760] [2024-11-19 19:34:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:58,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:58,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 19:34:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:58,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:58,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:34:58,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:58,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81027760] [2024-11-19 19:34:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81027760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471736986] [2024-11-19 19:34:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,563 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:58,582 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-19 19:34:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:58,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 19:34:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:58,583 INFO L225 Difference]: With dead ends: 30 [2024-11-19 19:34:58,583 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:34:58,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,584 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:58,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:34:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-19 19:34:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:34:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 19:34:58,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2024-11-19 19:34:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 19:34:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-19 19:34:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 19:34:58,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:58,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:58,594 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-11-19 19:34:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:58,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -594553411, now seen corresponding path program 1 times [2024-11-19 19:34:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774913386] [2024-11-19 19:34:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:58,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:58,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 19:34:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:58,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:34:58,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:34:58,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:58,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774913386] [2024-11-19 19:34:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774913386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:34:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211510881] [2024-11-19 19:34:58,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:58,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:34:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:34:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,877 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:58,894 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-19 19:34:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:34:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-19 19:34:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:58,895 INFO L225 Difference]: With dead ends: 30 [2024-11-19 19:34:58,896 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:34:58,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:34:58,897 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:58,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:34:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-19 19:34:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:34:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 19:34:58,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2024-11-19 19:34:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:58,905 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 19:34:58,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-19 19:34:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 19:34:58,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:34:58,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:58,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 19:34:59,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:59,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:34:59,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:34:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1148256924, now seen corresponding path program 1 times [2024-11-19 19:34:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:34:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325572368] [2024-11-19 19:34:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:34:59,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:59,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:34:59,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:34:59,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 19:34:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:34:59,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:34:59,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:34:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 19:34:59,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:34:59,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:34:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325572368] [2024-11-19 19:34:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325572368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:34:59,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:34:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:34:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127054389] [2024-11-19 19:34:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:34:59,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:34:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:34:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:34:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:34:59,255 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:34:59,277 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-19 19:34:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:34:59,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-19 19:34:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:34:59,278 INFO L225 Difference]: With dead ends: 22 [2024-11-19 19:34:59,278 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 19:34:59,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:34:59,278 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:34:59,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:34:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 19:34:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 19:34:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:34:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 19:34:59,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-19 19:34:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:34:59,279 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 19:34:59,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:34:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 19:34:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 19:34:59,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:34:59,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 19:34:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:34:59,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:34:59,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 19:34:59,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:34:59,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:34:59 BoogieIcfgContainer [2024-11-19 19:34:59,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:34:59,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:34:59,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:34:59,538 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:34:59,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:55" (3/4) ... [2024-11-19 19:34:59,540 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 19:34:59,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-11-19 19:34:59,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 19:34:59,547 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-19 19:34:59,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 19:34:59,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 19:34:59,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 19:34:59,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 19:34:59,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:34:59,667 INFO L158 Benchmark]: Toolchain (without parser) took 4822.49ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 34.6MB in the beginning and 58.2MB in the end (delta: -23.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,667 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 44.0MB. Free memory was 19.2MB in the beginning and 19.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:34:59,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.25ms. Allocated memory is still 60.8MB. Free memory was 34.4MB in the beginning and 37.1MB in the end (delta: -2.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 35.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,667 INFO L158 Benchmark]: Boogie Preprocessor took 49.16ms. Allocated memory is still 60.8MB. Free memory was 35.3MB in the beginning and 33.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,668 INFO L158 Benchmark]: RCFGBuilder took 356.18ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 33.2MB in the beginning and 60.1MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,668 INFO L158 Benchmark]: TraceAbstraction took 3976.75ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 50.5MB in the end (delta: 8.8MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,668 INFO L158 Benchmark]: Witness Printer took 128.50ms. Allocated memory is still 83.9MB. Free memory was 50.5MB in the beginning and 58.2MB in the end (delta: -7.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:34:59,670 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.83ms. Allocated memory is still 44.0MB. Free memory was 19.2MB in the beginning and 19.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.25ms. Allocated memory is still 60.8MB. Free memory was 34.4MB in the beginning and 37.1MB in the end (delta: -2.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 35.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.16ms. Allocated memory is still 60.8MB. Free memory was 35.3MB in the beginning and 33.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.18ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 33.2MB in the beginning and 60.1MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3976.75ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 50.5MB in the end (delta: 8.8MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 128.50ms. Allocated memory is still 83.9MB. Free memory was 50.5MB in the beginning and 58.2MB in the end (delta: -7.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 67]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 285 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 8 QuantifiedInterpolants, 304 SizeOfPredicates, 2 NumberOfNonLiveVariables, 739 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-19 19:34:59,688 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