./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:44:50,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:44:50,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:44:50,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:44:50,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:44:50,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:44:50,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:44:50,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:44:50,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:44:50,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:44:50,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:44:50,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:44:50,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:44:50,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:44:50,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:44:50,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:44:50,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:44:50,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:44:50,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:44:50,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:44:50,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:44:50,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:44:50,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:44:50,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:44:50,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:44:50,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:44:50,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:44:50,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:44:50,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:44:50,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:44:50,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:44:50,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:44:50,213 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-18 11:44:50,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:44:50,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:44:50,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:44:50,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:44:50,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:44:50,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-18 11:44:51,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:44:51,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:44:51,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-18 11:44:51,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa48c7c9/33604375c2074b5fa205a5bdf06eb836/FLAGb1b1d879a [2024-11-18 11:44:52,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa48c7c9/33604375c2074b5fa205a5bdf06eb836 [2024-11-18 11:44:52,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:44:52,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:44:52,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:44:52,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:44:52,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:44:52,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c805482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52, skipping insertion in model container [2024-11-18 11:44:52,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:44:52,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-18 11:44:52,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:44:52,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:44:52,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-18 11:44:52,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:44:52,450 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:44:52,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52 WrapperNode [2024-11-18 11:44:52,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:44:52,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:44:52,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:44:52,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:44:52,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,490 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-18 11:44:52,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:44:52,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:44:52,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:44:52,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:44:52,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,512 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-18 11:44:52,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:44:52,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:44:52,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:44:52,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:44:52,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (1/1) ... [2024-11-18 11:44:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:44:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:44:52,555 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-18 11:44:52,557 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-18 11:44:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:44:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:44:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 11:44:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 11:44:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:44:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-18 11:44:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-18 11:44:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-18 11:44:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-18 11:44:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-18 11:44:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:44:52,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:44:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 11:44:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 11:44:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 11:44:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:44:52,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:44:52,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:44:52,842 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-18 11:44:52,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:44:52,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:44:52,856 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:44:52,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:52 BoogieIcfgContainer [2024-11-18 11:44:52,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:44:52,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:44:52,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:44:52,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:44:52,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:44:52" (1/3) ... [2024-11-18 11:44:52,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426374f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:52, skipping insertion in model container [2024-11-18 11:44:52,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:52" (2/3) ... [2024-11-18 11:44:52,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426374f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:52, skipping insertion in model container [2024-11-18 11:44:52,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:52" (3/3) ... [2024-11-18 11:44:52,864 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-18 11:44:52,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:44:52,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:44:52,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:44:52,921 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;@536ad751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:44:52,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:44:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:44:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:44:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:52,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:52,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-18 11:44:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299786780] [2024-11-18 11:44:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:53,054 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-18 11:44:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:44:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299786780] [2024-11-18 11:44:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299786780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:44:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218126090] [2024-11-18 11:44:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:44:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:44:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:44:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:44:53,075 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:53,088 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-18 11:44:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:44:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-18 11:44:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:53,094 INFO L225 Difference]: With dead ends: 55 [2024-11-18 11:44:53,094 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:44:53,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:44:53,098 INFO L432 NwaCegarLoop]: 36 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, 36 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-18 11:44:53,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:44:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:44:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:44:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-18 11:44:53,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-18 11:44:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:53,123 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-18 11:44:53,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-18 11:44:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:44:53,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:53,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:53,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:44:53,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:53,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-18 11:44:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37234182] [2024-11-18 11:44:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:53,260 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-18 11:44:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:44:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37234182] [2024-11-18 11:44:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37234182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550194560] [2024-11-18 11:44:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:53,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:44:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,264 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:53,286 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 11:44:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-18 11:44:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:53,289 INFO L225 Difference]: With dead ends: 39 [2024-11-18 11:44:53,289 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 11:44:53,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,291 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:44:53,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 11:44:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 11:44:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:44:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:44:53,298 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-18 11:44:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:53,298 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:44:53,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:44:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:44:53,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:53,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:53,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:44:53,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:53,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-18 11:44:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852759333] [2024-11-18 11:44:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:53,404 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-18 11:44:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:44:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852759333] [2024-11-18 11:44:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852759333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850996873] [2024-11-18 11:44:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:53,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:44:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:53,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,407 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:53,430 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:44:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-18 11:44:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:53,431 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:44:53,431 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:44:53,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,433 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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-18 11:44:53,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:44:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:44:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:44:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:44:53,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-18 11:44:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:44:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:44:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 11:44:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:53,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:53,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 11:44:53,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:53,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-18 11:44:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71205549] [2024-11-18 11:44:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:44:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:44:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71205549] [2024-11-18 11:44:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71205549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774514630] [2024-11-18 11:44:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:44:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,531 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:53,553 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:44:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:53,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 11:44:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:53,555 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:44:53,555 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:44:53,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,556 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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-18 11:44:53,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:44:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:44:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:44:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:44:53,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-18 11:44:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:44:53,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:44:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:44:53,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:53,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-18 11:44:53,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 11:44:53,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:53,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-18 11:44:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240106469] [2024-11-18 11:44:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:53,654 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-18 11:44:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:44:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240106469] [2024-11-18 11:44:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240106469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:53,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66395881] [2024-11-18 11:44:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:44:53,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:53,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,659 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:53,684 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:44:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:53,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-18 11:44:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:53,685 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:44:53,685 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:44:53,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:53,686 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 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-18 11:44:53,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:44:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:44:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:44:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:44:53,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-18 11:44:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:53,693 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:44:53,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:44:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:44:53,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:53,694 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-18 11:44:53,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 11:44:53,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-18 11:44:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:44:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783040600] [2024-11-18 11:44:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:44:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:44:53,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:44:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:44:53,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 11:44:53,742 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:44:53,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:44:53,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 11:44:53,749 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 11:44:53,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:44:53,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:44:53 BoogieIcfgContainer [2024-11-18 11:44:53,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:44:53,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:44:53,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:44:53,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:44:53,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:52" (3/4) ... [2024-11-18 11:44:53,776 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 11:44:53,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:44:53,780 INFO L158 Benchmark]: Toolchain (without parser) took 1574.85ms. Allocated memory is still 178.3MB. Free memory was 151.0MB in the beginning and 65.7MB in the end (delta: 85.3MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,781 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 109.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:44:53,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.28ms. Allocated memory is still 178.3MB. Free memory was 150.6MB in the beginning and 137.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.55ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 136.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:44:53,781 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,781 INFO L158 Benchmark]: RCFGBuilder took 333.98ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 143.3MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,782 INFO L158 Benchmark]: TraceAbstraction took 913.66ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 66.8MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,782 INFO L158 Benchmark]: Witness Printer took 7.44ms. Allocated memory is still 178.3MB. Free memory was 66.8MB in the beginning and 65.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:44:53,783 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.71ms. Allocated memory is still 109.1MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.28ms. Allocated memory is still 178.3MB. Free memory was 150.6MB in the beginning and 137.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.55ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 136.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.98ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 143.3MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 913.66ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 66.8MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 7.44ms. Allocated memory is still 178.3MB. Free memory was 66.8MB in the beginning and 65.7MB in the end (delta: 1.1MB). 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 - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=0, \result=0, x=0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0, y=4294967306] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\result=4294967306, x=0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4294967306] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 175 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 11:44:53,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:44:55,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:44:55,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 11:44:55,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:44:55,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:44:55,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:44:55,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:44:55,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:44:55,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:44:55,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:44:55,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:44:55,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:44:55,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:44:55,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:44:55,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:44:55,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:44:55,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:44:55,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:44:55,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:44:55,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:44:55,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:44:55,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:44:55,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:44:55,680 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 11:44:55,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 11:44:55,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:44:55,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 11:44:55,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:44:55,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:44:55,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:44:55,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:44:55,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:44:55,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:44:55,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:44:55,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:44:55,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:44:55,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:44:55,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:44:55,683 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 11:44:55,684 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 11:44:55,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:44:55,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:44:55,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:44:55,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:44:55,685 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-18 11:44:55,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:44:55,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:44:55,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:44:55,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:44:55,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:44:55,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-18 11:44:57,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:44:57,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:44:57,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-18 11:44:57,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba86be55c/0372bcce728846fabff3b87f65de05e3/FLAG4758a786c [2024-11-18 11:44:57,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba86be55c/0372bcce728846fabff3b87f65de05e3 [2024-11-18 11:44:57,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:44:57,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:44:57,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:44:57,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:44:57,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:44:57,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515a28d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57, skipping insertion in model container [2024-11-18 11:44:57,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:44:57,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-18 11:44:57,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:44:57,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:44:57,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-18 11:44:57,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:44:57,652 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:44:57,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57 WrapperNode [2024-11-18 11:44:57,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:44:57,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:44:57,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:44:57,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:44:57,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,683 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-18 11:44:57,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:44:57,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:44:57,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:44:57,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:44:57,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,719 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-18 11:44:57,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:44:57,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:44:57,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:44:57,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:44:57,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (1/1) ... [2024-11-18 11:44:57,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:44:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:44:57,779 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-18 11:44:57,784 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-18 11:44:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:44:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-18 11:44:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-18 11:44:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-18 11:44:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-18 11:44:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-18 11:44:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-18 11:44:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:44:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:44:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:44:57,905 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:44:57,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:44:58,105 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-18 11:44:58,105 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:44:58,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:44:58,117 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:44:58,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:58 BoogieIcfgContainer [2024-11-18 11:44:58,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:44:58,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:44:58,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:44:58,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:44:58,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:44:57" (1/3) ... [2024-11-18 11:44:58,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7e8b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:58, skipping insertion in model container [2024-11-18 11:44:58,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:57" (2/3) ... [2024-11-18 11:44:58,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7e8b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:58, skipping insertion in model container [2024-11-18 11:44:58,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:58" (3/3) ... [2024-11-18 11:44:58,127 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-18 11:44:58,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:44:58,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:44:58,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:44:58,203 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;@6483cd77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:44:58,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:44:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:44:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:44:58,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:58,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:58,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-18 11:44:58,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:44:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811369870] [2024-11-18 11:44:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:58,232 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-18 11:44:58,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:44:58,242 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-18 11:44:58,244 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-18 11:44:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:58,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 11:44:58,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:44:58,334 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-18 11:44:58,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:44:58,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:44:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811369870] [2024-11-18 11:44:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811369870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:44:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261911497] [2024-11-18 11:44:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:58,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:44:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:44:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:44:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:44:58,361 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:58,376 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-18 11:44:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:44:58,378 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-18 11:44:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:58,383 INFO L225 Difference]: With dead ends: 51 [2024-11-18 11:44:58,384 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 11:44:58,386 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-18 11:44:58,390 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:44:58,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 11:44:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 11:44:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:44:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-18 11:44:58,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-18 11:44:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:58,419 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-18 11:44:58,420 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-18 11:44:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-18 11:44:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:44:58,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:58,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:58,428 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-18 11:44:58,626 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-18 11:44:58,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:58,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-18 11:44:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:44:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455887975] [2024-11-18 11:44:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:58,630 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-18 11:44:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:44:58,634 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-18 11:44:58,635 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-18 11:44:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:58,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:44:58,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:44:58,854 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-18 11:44:58,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:44:58,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:44:58,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455887975] [2024-11-18 11:44:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455887975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:58,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134302742] [2024-11-18 11:44:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:58,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:44:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:58,857 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:58,884 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-18 11:44:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:58,885 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-18 11:44:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:58,886 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:44:58,887 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:44:58,887 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-18 11:44:58,889 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:44:58,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:44:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:44:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 11:44:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-18 11:44:58,896 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-18 11:44:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:58,896 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-18 11:44:58,896 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-18 11:44:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-18 11:44:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:44:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:58,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:58,900 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-18 11:44:59,098 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-18 11:44:59,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:59,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-18 11:44:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:44:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260939247] [2024-11-18 11:44:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:59,099 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-18 11:44:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:44:59,102 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-18 11:44:59,103 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-18 11:44:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:59,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 11:44:59,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:44:59,334 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-18 11:44:59,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:44:59,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:44:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260939247] [2024-11-18 11:44:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260939247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:44:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257628031] [2024-11-18 11:44:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:44:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:44:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:44:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:44:59,336 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:59,565 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-18 11:44:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 11:44:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-18 11:44:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:59,567 INFO L225 Difference]: With dead ends: 53 [2024-11-18 11:44:59,568 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 11:44:59,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-18 11:44:59,570 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 11:44:59,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 11:44:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 11:44:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-18 11:44:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 11:44:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-18 11:44:59,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-18 11:44:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:59,580 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-18 11:44:59,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-18 11:44:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:44:59,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:59,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:59,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 11:44:59,782 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-18 11:44:59,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:44:59,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:44:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1221479789, now seen corresponding path program 1 times [2024-11-18 11:44:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:44:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454896703] [2024-11-18 11:44:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:44:59,784 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-18 11:44:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:44:59,786 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-18 11:44:59,787 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-18 11:44:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:44:59,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:44:59,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:44:59,852 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-18 11:44:59,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:44:59,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:44:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454896703] [2024-11-18 11:44:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454896703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:44:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:44:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:44:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103445819] [2024-11-18 11:44:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:44:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:44:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:44:59,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:44:59,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:44:59,855 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:44:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:44:59,890 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-18 11:44:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:44:59,891 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-18 11:44:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:44:59,893 INFO L225 Difference]: With dead ends: 41 [2024-11-18 11:44:59,893 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 11:44:59,894 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-18 11:44:59,894 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:44:59,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:44:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 11:44:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-18 11:44:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 11:44:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-18 11:44:59,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-11-18 11:44:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:44:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-18 11:44:59,900 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-18 11:44:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-18 11:44:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 11:44:59,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:44:59,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:44:59,905 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-18 11:45:00,104 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-18 11:45:00,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:00,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1991232473, now seen corresponding path program 1 times [2024-11-18 11:45:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105781693] [2024-11-18 11:45:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:00,106 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-18 11:45:00,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:00,107 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-18 11:45:00,108 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-18 11:45:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:00,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 11:45:00,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:00,271 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-18 11:45:00,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:00,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105781693] [2024-11-18 11:45:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105781693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:45:00,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848664326] [2024-11-18 11:45:00,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:00,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:45:00,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:00,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:45:00,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:45:00,274 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:45:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:00,433 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-18 11:45:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:45:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 11:45:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:00,444 INFO L225 Difference]: With dead ends: 53 [2024-11-18 11:45:00,444 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 11:45:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:45:00,445 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:00,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:45:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 11:45:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-18 11:45:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:45:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-18 11:45:00,455 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-18 11:45:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:00,455 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-18 11:45:00,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:45:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-18 11:45:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:45:00,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:00,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:45:00,461 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-18 11:45:00,657 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-18 11:45:00,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:00,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-18 11:45:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858468506] [2024-11-18 11:45:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:00,659 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-18 11:45:00,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:00,662 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-18 11:45:00,665 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-18 11:45:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:00,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:45:00,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:00,751 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-18 11:45:00,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:00,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858468506] [2024-11-18 11:45:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858468506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:45:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212447586] [2024-11-18 11:45:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:45:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:45:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:45:00,756 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:00,776 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-18 11:45:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:45:00,776 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-18 11:45:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:00,777 INFO L225 Difference]: With dead ends: 38 [2024-11-18 11:45:00,777 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 11:45:00,777 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-18 11:45:00,778 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:00,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:45:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 11:45:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 11:45:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 11:45:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-18 11:45:00,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2024-11-18 11:45:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-18 11:45:00,783 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-18 11:45:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-18 11:45:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:45:00,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:00,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:45:00,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-18 11:45:00,987 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-18 11:45:00,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-18 11:45:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604374114] [2024-11-18 11:45:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:00,990 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-18 11:45:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:00,992 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-18 11:45:00,993 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-18 11:45:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:01,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:45:01,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:01,093 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-18 11:45:01,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:01,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:01,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604374114] [2024-11-18 11:45:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604374114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:01,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:01,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 11:45:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995656232] [2024-11-18 11:45:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:01,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 11:45:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:01,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 11:45:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:45:01,094 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:01,124 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-18 11:45:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 11:45:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-18 11:45:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:01,125 INFO L225 Difference]: With dead ends: 34 [2024-11-18 11:45:01,125 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 11:45:01,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:45:01,126 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:01,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:45:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 11:45:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 11:45:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 11:45:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-18 11:45:01,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2024-11-18 11:45:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:01,136 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-18 11:45:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-18 11:45:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 11:45:01,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:01,137 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-18 11:45:01,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 11:45:01,338 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-18 11:45:01,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-18 11:45:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096842293] [2024-11-18 11:45:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:01,339 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-18 11:45:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:01,342 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-18 11:45:01,343 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-18 11:45:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:01,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:45:01,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 11:45:01,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:01,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096842293] [2024-11-18 11:45:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096842293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:01,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:45:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117938329] [2024-11-18 11:45:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:45:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:45:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:45:01,554 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:01,722 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-18 11:45:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 11:45:01,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-18 11:45:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:01,723 INFO L225 Difference]: With dead ends: 45 [2024-11-18 11:45:01,723 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 11:45:01,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-18 11:45:01,724 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:01,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:45:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 11:45:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 11:45:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 11:45:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-18 11:45:01,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2024-11-18 11:45:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:01,733 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-18 11:45:01,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-18 11:45:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:45:01,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:01,735 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-18 11:45:01,741 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-18 11:45:01,938 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-18 11:45:01,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:01,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 178525002, now seen corresponding path program 1 times [2024-11-18 11:45:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:01,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792606465] [2024-11-18 11:45:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 11:45:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:01,942 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-18 11:45:01,942 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-18 11:45:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:02,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:45:02,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:02,026 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-18 11:45:02,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:02,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792606465] [2024-11-18 11:45:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792606465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:45:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235570283] [2024-11-18 11:45:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:45:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:45:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:45:02,029 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:02,050 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-18 11:45:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:45:02,050 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-18 11:45:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:02,051 INFO L225 Difference]: With dead ends: 41 [2024-11-18 11:45:02,051 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 11:45:02,051 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-18 11:45:02,052 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:02,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:45:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 11:45:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-18 11:45:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:45:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-18 11:45:02,058 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-11-18 11:45:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:02,058 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-18 11:45:02,059 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-18 11:45:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-18 11:45:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 11:45:02,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:02,059 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-18 11:45:02,064 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-18 11:45:02,259 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-18 11:45:02,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:02,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1847075342, now seen corresponding path program 1 times [2024-11-18 11:45:02,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:02,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524675948] [2024-11-18 11:45:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:02,261 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-18 11:45:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:02,263 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-18 11:45:02,264 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-18 11:45:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:02,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:45:02,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 11:45:02,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:02,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524675948] [2024-11-18 11:45:02,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524675948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:02,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:02,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:45:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651597887] [2024-11-18 11:45:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:45:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:45:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:45:02,422 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:02,551 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-18 11:45:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:45:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-18 11:45:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:02,552 INFO L225 Difference]: With dead ends: 38 [2024-11-18 11:45:02,552 INFO L226 Difference]: Without dead ends: 23 [2024-11-18 11:45:02,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:45:02,553 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:02,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:45:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-18 11:45:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-18 11:45:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 11:45:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-18 11:45:02,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2024-11-18 11:45:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-18 11:45:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-18 11:45:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:45:02,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:45:02,557 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:45:02,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-18 11:45:02,757 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-18 11:45:02,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:45:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:45:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-18 11:45:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:45:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443122422] [2024-11-18 11:45:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:45:02,759 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-18 11:45:02,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:45:02,760 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-18 11:45:02,761 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-18 11:45:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:45:02,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 11:45:02,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:45:02,939 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-18 11:45:02,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:45:02,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:45:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443122422] [2024-11-18 11:45:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443122422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:45:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:45:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 11:45:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895852436] [2024-11-18 11:45:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:45:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 11:45:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:45:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 11:45:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:45:02,940 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:45:03,011 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-18 11:45:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 11:45:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-18 11:45:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:45:03,012 INFO L225 Difference]: With dead ends: 23 [2024-11-18 11:45:03,012 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 11:45:03,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-18 11:45:03,013 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:45:03,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:45:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 11:45:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 11:45:03,013 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-18 11:45:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 11:45:03,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-18 11:45:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:45:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 11:45:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 11:45:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 11:45:03,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 11:45:03,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:45:03,022 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-18 11:45:03,218 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-18 11:45:03,221 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:45:03,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 11:45:03,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:45:03,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:45:03,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:45:03,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:45:03,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:45:03 BoogieIcfgContainer [2024-11-18 11:45:03,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:45:03,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:45:03,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:45:03,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:45:03,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:58" (3/4) ... [2024-11-18 11:45:03,525 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 11:45:03,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-18 11:45:03,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-18 11:45:03,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-18 11:45:03,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 11:45:03,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 11:45:03,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 11:45:03,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 11:45:03,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:45:03,601 INFO L158 Benchmark]: Toolchain (without parser) took 6200.36ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 42.0MB in the beginning and 63.6MB in the end (delta: -21.6MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,601 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:45:03,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.30ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 41.6MB in the beginning and 70.5MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 90.2MB. Free memory was 70.5MB in the beginning and 68.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:45:03,602 INFO L158 Benchmark]: Boogie Preprocessor took 62.68ms. Allocated memory is still 90.2MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,602 INFO L158 Benchmark]: RCFGBuilder took 370.08ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 51.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,602 INFO L158 Benchmark]: TraceAbstraction took 5402.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 50.6MB in the beginning and 68.9MB in the end (delta: -18.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,602 INFO L158 Benchmark]: Witness Printer took 77.95ms. Allocated memory is still 109.1MB. Free memory was 68.9MB in the beginning and 63.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 11:45:03,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.30ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 41.6MB in the beginning and 70.5MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 90.2MB. Free memory was 70.5MB in the beginning and 68.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.68ms. Allocated memory is still 90.2MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 370.08ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 51.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5402.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 50.6MB in the beginning and 68.9MB in the end (delta: -18.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 77.95ms. Allocated memory is still 109.1MB. Free memory was 68.9MB in the beginning and 63.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 275 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 26 QuantifiedInterpolants, 849 SizeOfPredicates, 17 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-18 11:45:03,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE