./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/float_req_bl_1252b.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 c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:21:29,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:21:29,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 05:21:29,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:21:29,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:21:29,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:21:29,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:21:29,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:21:29,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:21:29,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:21:29,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:21:29,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:21:29,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:21:29,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:21:29,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:21:29,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:21:29,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:21:29,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:21:29,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 05:21:29,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:21:29,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:21:29,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:21:29,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:21:29,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:21:29,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:21:29,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:21:29,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:21:29,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:21:29,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:21:29,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:21:29,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:21:29,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:21:29,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:29,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:21:29,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:21:29,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:21:29,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 05:21:29,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 05:21:29,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:21:29,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:21:29,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:21:29,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:21:29,576 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-16 05:21:29,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:21:29,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:21:29,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:21:29,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:21:29,861 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:21:29,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-16 05:21:31,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:21:31,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:21:31,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-16 05:21:31,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e060a8483/4195204a81564e4fa10aebdc8871eadc/FLAG36aee0f56 [2024-11-16 05:21:31,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e060a8483/4195204a81564e4fa10aebdc8871eadc [2024-11-16 05:21:31,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:21:31,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:21:31,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:31,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:21:31,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:21:31,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:31" (1/1) ... [2024-11-16 05:21:31,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b56c0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:31, skipping insertion in model container [2024-11-16 05:21:31,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:31" (1/1) ... [2024-11-16 05:21:31,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:21:32,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-16 05:21:32,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:32,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:21:32,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-16 05:21:32,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:32,189 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:21:32,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32 WrapperNode [2024-11-16 05:21:32,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:32,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:32,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:21:32,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:21:32,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,223 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-16 05:21:32,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:32,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:21:32,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:21:32,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:21:32,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,251 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 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-16 05:21:32,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:21:32,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:21:32,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:21:32,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:21:32,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (1/1) ... [2024-11-16 05:21:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:21:32,323 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-16 05:21:32,327 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-16 05:21:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:21:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 05:21:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 05:21:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 05:21:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:21:32,381 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-16 05:21:32,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-16 05:21:32,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 05:21:32,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 05:21:32,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 05:21:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:21:32,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:21:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 05:21:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 05:21:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 05:21:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:21:32,484 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:21:32,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:21:32,742 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 05:21:32,742 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:21:32,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:21:32,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:21:32,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:32 BoogieIcfgContainer [2024-11-16 05:21:32,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:21:32,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:21:32,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:21:32,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:21:32,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:21:31" (1/3) ... [2024-11-16 05:21:32,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ebd5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:32, skipping insertion in model container [2024-11-16 05:21:32,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:32" (2/3) ... [2024-11-16 05:21:32,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ebd5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:32, skipping insertion in model container [2024-11-16 05:21:32,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:32" (3/3) ... [2024-11-16 05:21:32,762 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-16 05:21:32,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:21:32,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:21:32,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:21:32,837 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;@28cb18d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:21:32,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:21:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-16 05:21:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 05:21:32,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:32,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:32,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 281430993, now seen corresponding path program 1 times [2024-11-16 05:21:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110477526] [2024-11-16 05:21:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,045 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-16 05:21:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110477526] [2024-11-16 05:21:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110477526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:21:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96747974] [2024-11-16 05:21:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:33,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:21:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:21:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:21:33,080 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:33,141 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2024-11-16 05:21:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:21:33,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-16 05:21:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:33,151 INFO L225 Difference]: With dead ends: 56 [2024-11-16 05:21:33,151 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:21:33,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:21:33,160 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:33,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:21:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-16 05:21:33,195 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-16 05:21:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-16 05:21:33,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-16 05:21:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-16 05:21:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-16 05:21:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:21:33,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:33,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 05:21:33,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -34966834, now seen corresponding path program 1 times [2024-11-16 05:21:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762990099] [2024-11-16 05:21:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,524 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-16 05:21:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762990099] [2024-11-16 05:21:33,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762990099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:33,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:33,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567946100] [2024-11-16 05:21:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:33,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:33,532 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:33,582 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-16 05:21:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:33,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-16 05:21:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:33,587 INFO L225 Difference]: With dead ends: 39 [2024-11-16 05:21:33,588 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 05:21:33,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:33,591 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:33,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 05:21:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 05:21:33,602 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-16 05:21:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-16 05:21:33,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-16 05:21:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:33,605 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-16 05:21:33,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-16 05:21:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 05:21:33,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:33,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:33,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 05:21:33,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:33,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -366289900, now seen corresponding path program 1 times [2024-11-16 05:21:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309874072] [2024-11-16 05:21:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:33,832 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-16 05:21:33,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309874072] [2024-11-16 05:21:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309874072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744263863] [2024-11-16 05:21:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:33,835 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:33,896 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-16 05:21:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:33,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 05:21:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:33,897 INFO L225 Difference]: With dead ends: 43 [2024-11-16 05:21:33,898 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 05:21:33,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:33,899 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:33,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 05:21:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-16 05:21:33,905 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-16 05:21:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-16 05:21:33,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-16 05:21:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:33,907 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-16 05:21:33,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-16 05:21:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:21:33,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:33,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 05:21:33,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:33,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 833169489, now seen corresponding path program 1 times [2024-11-16 05:21:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440273637] [2024-11-16 05:21:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:34,056 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-16 05:21:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440273637] [2024-11-16 05:21:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440273637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767336962] [2024-11-16 05:21:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:34,060 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:34,122 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-16 05:21:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:21:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:34,125 INFO L225 Difference]: With dead ends: 43 [2024-11-16 05:21:34,125 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 05:21:34,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:34,126 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:34,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 05:21:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-16 05:21:34,139 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-16 05:21:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-16 05:21:34,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-16 05:21:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-16 05:21:34,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-16 05:21:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:21:34,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:34,143 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-16 05:21:34,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 05:21:34,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:34,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2052722569, now seen corresponding path program 1 times [2024-11-16 05:21:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:34,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331750324] [2024-11-16 05:21:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:34,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:34,265 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-16 05:21:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331750324] [2024-11-16 05:21:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331750324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968063725] [2024-11-16 05:21:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:34,269 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:34,305 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-16 05:21:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-16 05:21:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:34,307 INFO L225 Difference]: With dead ends: 43 [2024-11-16 05:21:34,308 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 05:21:34,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:34,309 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:34,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 05:21:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-16 05:21:34,320 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-16 05:21:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-16 05:21:34,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-16 05:21:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:34,323 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-16 05:21:34,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:21:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-16 05:21:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:21:34,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:34,324 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-16 05:21:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 05:21:34,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:34,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 434790264, now seen corresponding path program 1 times [2024-11-16 05:21:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073993788] [2024-11-16 05:21:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:34,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:21:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:34,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 05:21:34,384 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:21:34,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:21:34,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 05:21:34,394 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 05:21:34,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:21:34,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:21:34 BoogieIcfgContainer [2024-11-16 05:21:34,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:21:34,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:21:34,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:21:34,420 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:21:34,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:32" (3/4) ... [2024-11-16 05:21:34,423 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 05:21:34,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:21:34,424 INFO L158 Benchmark]: Toolchain (without parser) took 2492.87ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 131.8MB in the beginning and 130.7MB in the end (delta: 1.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,424 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:34,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.75ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 118.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,425 INFO L158 Benchmark]: Boogie Preprocessor took 41.39ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,425 INFO L158 Benchmark]: IcfgBuilder took 488.46ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 100.9MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,426 INFO L158 Benchmark]: TraceAbstraction took 1662.64ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 100.3MB in the beginning and 130.7MB in the end (delta: -30.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-16 05:21:34,426 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 220.2MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:34,427 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.23ms. Allocated memory is still 163.6MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.75ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 118.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 163.6MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.39ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 488.46ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 100.9MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1662.64ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 100.3MB in the beginning and 130.7MB in the end (delta: -30.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 220.2MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someUnaryFLOAToperation at line 76. Possible FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L23] __uint32_t w; VAL [\old(x)=0, x=0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L29] COND FALSE !(0) VAL [\old(x)=0, w=4286578689, x=0] [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=4286578689, x=0] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=0, \result=0, x=0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0, y=4286578698] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\result=4286578698, x=0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=4286578698] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() VAL [res=4286578698] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 05:21:34,455 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/float_req_bl_1252b.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 c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:21:36,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:21:36,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 05:21:36,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:21:36,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:21:36,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:21:36,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:21:36,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:21:36,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:21:36,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:21:36,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:21:36,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:21:36,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:21:36,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:21:36,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:21:36,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:21:36,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:21:36,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:21:36,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:21:36,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:21:36,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:21:36,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:21:36,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:21:36,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 05:21:36,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 05:21:36,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:21:36,842 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 05:21:36,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:21:36,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:21:36,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:21:36,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:21:36,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:21:36,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:21:36,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:21:36,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:36,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:21:36,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:21:36,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:21:36,846 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 05:21:36,847 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 05:21:36,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:21:36,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:21:36,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:21:36,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:21:36,848 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-16 05:21:37,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:21:37,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:21:37,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:21:37,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:21:37,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:21:37,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-16 05:21:38,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:21:39,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:21:39,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-16 05:21:39,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437eec6a2/f0ed3e72c68f4b118519749b7bd48487/FLAG18205b26d [2024-11-16 05:21:39,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437eec6a2/f0ed3e72c68f4b118519749b7bd48487 [2024-11-16 05:21:39,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:21:39,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:21:39,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:39,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:21:39,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:21:39,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44990e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39, skipping insertion in model container [2024-11-16 05:21:39,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:21:39,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-16 05:21:39,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:39,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:21:39,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-16 05:21:39,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:39,423 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:21:39,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39 WrapperNode [2024-11-16 05:21:39,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:39,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:39,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:21:39,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:21:39,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,464 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-16 05:21:39,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:39,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:21:39,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:21:39,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:21:39,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,506 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 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-16 05:21:39,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:21:39,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:21:39,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:21:39,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:21:39,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (1/1) ... [2024-11-16 05:21:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:39,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:21:39,569 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-16 05:21:39,575 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-16 05:21:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:21:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 05:21:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 05:21:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 05:21:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:21:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-16 05:21:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-16 05:21:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 05:21:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 05:21:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 05:21:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:21:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:21:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 05:21:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 05:21:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 05:21:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:21:39,730 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:21:39,732 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:21:39,962 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 05:21:39,962 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:21:39,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:21:39,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:21:39,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:39 BoogieIcfgContainer [2024-11-16 05:21:39,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:21:39,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:21:39,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:21:39,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:21:39,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:21:39" (1/3) ... [2024-11-16 05:21:39,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552482f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:39, skipping insertion in model container [2024-11-16 05:21:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:39" (2/3) ... [2024-11-16 05:21:40,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552482f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:40, skipping insertion in model container [2024-11-16 05:21:40,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:39" (3/3) ... [2024-11-16 05:21:40,002 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-16 05:21:40,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:21:40,019 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:21:40,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:21:40,086 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;@debcec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:21:40,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:21:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-16 05:21:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 05:21:40,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:40,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:40,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:40,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 130515667, now seen corresponding path program 1 times [2024-11-16 05:21:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593474903] [2024-11-16 05:21:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:40,118 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-16 05:21:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:40,122 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-16 05:21:40,123 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-16 05:21:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:40,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 05:21:40,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:40,239 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-16 05:21:40,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:40,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593474903] [2024-11-16 05:21:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593474903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:21:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279125654] [2024-11-16 05:21:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:40,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:21:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:21:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:21:40,271 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-16 05:21:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:40,293 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2024-11-16 05:21:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:21:40,295 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-16 05:21:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:40,300 INFO L225 Difference]: With dead ends: 52 [2024-11-16 05:21:40,300 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 05:21:40,305 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-16 05:21:40,309 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-16 05:21:40,310 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-16 05:21:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 05:21:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-16 05:21:40,345 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-16 05:21:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-16 05:21:40,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-16 05:21:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:40,348 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-16 05:21:40,348 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-16 05:21:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-16 05:21:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 05:21:40,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:40,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:40,356 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-16 05:21:40,552 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-16 05:21:40,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:40,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1908286854, now seen corresponding path program 1 times [2024-11-16 05:21:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:40,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741933725] [2024-11-16 05:21:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:40,554 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-16 05:21:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:40,557 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-16 05:21:40,558 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-16 05:21:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:40,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:40,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:40,676 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-16 05:21:40,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:40,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741933725] [2024-11-16 05:21:40,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741933725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:40,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240128980] [2024-11-16 05:21:40,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:40,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:40,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:40,680 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-16 05:21:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:40,715 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-16 05:21:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:40,716 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-16 05:21:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:40,719 INFO L225 Difference]: With dead ends: 36 [2024-11-16 05:21:40,719 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:21:40,720 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-16 05:21:40,723 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-16 05:21:40,724 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-16 05:21:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:21:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 05:21:40,734 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-16 05:21:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-16 05:21:40,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-16 05:21:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:40,736 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-16 05:21:40,737 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-16 05:21:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-16 05:21:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:21:40,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:40,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:40,744 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-16 05:21:40,939 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-16 05:21:40,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1627871568, now seen corresponding path program 1 times [2024-11-16 05:21:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016622901] [2024-11-16 05:21:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:40,942 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-16 05:21:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:40,945 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-16 05:21:40,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 05:21:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:40,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 05:21:41,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:41,200 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-16 05:21:41,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:41,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016622901] [2024-11-16 05:21:41,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016622901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:41,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:41,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 05:21:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889227867] [2024-11-16 05:21:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:41,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 05:21:41,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:41,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 05:21:41,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:21:41,203 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-16 05:21:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:41,429 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-16 05:21:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:21:41,430 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-16 05:21:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:41,431 INFO L225 Difference]: With dead ends: 49 [2024-11-16 05:21:41,431 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:21:41,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-16 05:21:41,434 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:41,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:21:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-16 05:21:41,439 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-16 05:21:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-16 05:21:41,440 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-16 05:21:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:41,441 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-16 05:21:41,441 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-16 05:21:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-16 05:21:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 05:21:41,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:41,442 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:41,447 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-16 05:21:41,646 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-16 05:21:41,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:41,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash -8599178, now seen corresponding path program 1 times [2024-11-16 05:21:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763682378] [2024-11-16 05:21:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:41,648 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-16 05:21:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:41,649 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-16 05:21:41,652 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-16 05:21:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:41,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:41,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:41,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-16 05:21:41,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:41,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763682378] [2024-11-16 05:21:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763682378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:41,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527069755] [2024-11-16 05:21:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:41,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:41,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:41,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:41,754 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-16 05:21:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:41,774 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-16 05:21:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:41,775 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-16 05:21:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:41,776 INFO L225 Difference]: With dead ends: 36 [2024-11-16 05:21:41,776 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:21:41,776 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-16 05:21:41,777 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-16 05:21:41,777 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-16 05:21:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:21:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 05:21:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-16 05:21:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-16 05:21:41,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-16 05:21:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:41,782 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-16 05:21:41,782 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-16 05:21:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-16 05:21:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 05:21:41,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:41,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-16 05:21:41,789 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-16 05:21:41,984 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-16 05:21:41,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -6752136, now seen corresponding path program 1 times [2024-11-16 05:21:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037125563] [2024-11-16 05:21:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:41,985 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-16 05:21:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:41,987 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-16 05:21:41,988 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-16 05:21:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:42,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 05:21:42,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:42,154 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-16 05:21:42,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:42,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037125563] [2024-11-16 05:21:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037125563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:42,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328390569] [2024-11-16 05:21:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:42,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:42,156 INFO L87 Difference]: Start difference. First operand 27 states and 33 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-16 05:21:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:42,198 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-16 05:21:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:42,199 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-16 05:21:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:42,200 INFO L225 Difference]: With dead ends: 32 [2024-11-16 05:21:42,202 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 05:21:42,203 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-16 05:21:42,203 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-16 05:21:42,204 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-16 05:21:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 05:21:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 05:21:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-16 05:21:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-16 05:21:42,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-16 05:21:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:42,216 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-16 05:21:42,216 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-16 05:21:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-16 05:21:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 05:21:42,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:42,218 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-16 05:21:42,223 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-16 05:21:42,422 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-16 05:21:42,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1010818546, now seen corresponding path program 1 times [2024-11-16 05:21:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817784271] [2024-11-16 05:21:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:42,424 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-16 05:21:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:42,425 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-16 05:21:42,426 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-16 05:21:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:42,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 05:21:42,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:42,649 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-16 05:21:42,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:42,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817784271] [2024-11-16 05:21:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817784271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 05:21:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274435662] [2024-11-16 05:21:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:42,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 05:21:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:42,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 05:21:42,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:21:42,656 INFO L87 Difference]: Start difference. First operand 29 states and 35 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-16 05:21:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:42,811 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-16 05:21:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:21:42,813 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-16 05:21:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:42,814 INFO L225 Difference]: With dead ends: 38 [2024-11-16 05:21:42,814 INFO L226 Difference]: Without dead ends: 21 [2024-11-16 05:21:42,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 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-16 05:21:42,816 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 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-16 05:21:42,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-16 05:21:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-16 05:21:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 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-16 05:21:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-16 05:21:42,823 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-16 05:21:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:42,824 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-16 05:21:42,824 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-16 05:21:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-16 05:21:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 05:21:42,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:42,825 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-16 05:21:42,828 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-16 05:21:43,025 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-16 05:21:43,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:43,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash -98084589, now seen corresponding path program 1 times [2024-11-16 05:21:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110993112] [2024-11-16 05:21:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:43,027 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-16 05:21:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:43,029 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-16 05:21:43,030 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-16 05:21:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:43,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:21:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:43,176 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 05:21:43,176 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:21:43,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:21:43,188 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-16 05:21:43,379 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-16 05:21:43,383 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:43,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:21:43,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:21:43 BoogieIcfgContainer [2024-11-16 05:21:43,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:21:43,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:21:43,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:21:43,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:21:43,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:39" (3/4) ... [2024-11-16 05:21:43,432 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 05:21:43,487 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 05:21:43,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:21:43,488 INFO L158 Benchmark]: Toolchain (without parser) took 4397.17ms. Allocated memory was 58.7MB in the beginning and 96.5MB in the end (delta: 37.7MB). Free memory was 30.3MB in the beginning and 49.3MB in the end (delta: -19.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,488 INFO L158 Benchmark]: CDTParser took 1.79ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:43,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.15ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 54.1MB in the end (delta: -23.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.04ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 52.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:43,489 INFO L158 Benchmark]: Boogie Preprocessor took 66.29ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 50.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,489 INFO L158 Benchmark]: IcfgBuilder took 444.83ms. Allocated memory is still 79.7MB. Free memory was 50.3MB in the beginning and 35.9MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,489 INFO L158 Benchmark]: TraceAbstraction took 3435.58ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,490 INFO L158 Benchmark]: Witness Printer took 57.72ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 49.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:43,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.79ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.15ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 54.1MB in the end (delta: -23.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.04ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 52.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.29ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 50.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 444.83ms. Allocated memory is still 79.7MB. Free memory was 50.3MB in the beginning and 35.9MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3435.58ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 57.72ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 49.3MB in the end (delta: 2.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 - CounterExampleResult [Line: 81]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L29] COND FALSE !(0) VAL [\old(x)=0.0, w=0, x=0.0] [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_float(x) == 0) [L50] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L29] COND FALSE !(0) VAL [\old(x)=0.0, w=-2147483648, x=0.0] [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_float(y) == 0) [L53] return x > y ? x : y; VAL [\result=0.0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0.0] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] CALL, EXPR __signbit_float(res) [L57] __uint32_t w; VAL [x=0.0] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (w) = gf_u.word [L63] COND FALSE !(0) VAL [w=-2147483648, x=0.0] [L65] return (w & 0x80000000) != 0; VAL [\result=1, x=0.0] [L80] RET, EXPR __signbit_float(res) [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 29, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 283 SizeOfPredicates, 9 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2024-11-16 05:21:43,524 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE