./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_1232a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:22:05,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:22:06,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 18:22:06,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:22:06,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:22:06,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:22:06,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:22:06,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:22:06,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:22:06,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:22:06,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:22:06,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:22:06,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:22:06,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:22:06,062 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:22:06,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:22:06,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:22:06,063 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:22:06,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 18:22:06,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:22:06,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:22:06,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:22:06,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:22:06,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:22:06,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:22:06,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:22:06,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:22:06,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:22:06,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:22:06,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:22:06,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:22:06,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:22:06,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:06,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:22:06,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:22:06,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:22:06,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 18:22:06,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 18:22:06,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:22:06,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:22:06,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:22:06,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:22:06,070 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-11-11 18:22:06,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:22:06,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:22:06,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:22:06,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:22:06,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:22:06,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-11 18:22:07,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:22:08,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:22:08,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-11 18:22:08,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a04d9b5/e8c72946f09a4b8ca47e3363a18ca74d/FLAG2df48f96b [2024-11-11 18:22:08,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a04d9b5/e8c72946f09a4b8ca47e3363a18ca74d [2024-11-11 18:22:08,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:22:08,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:22:08,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:08,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:22:08,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:22:08,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4a5bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08, skipping insertion in model container [2024-11-11 18:22:08,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:22:08,308 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_1232a.c[1656,1669] [2024-11-11 18:22:08,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:08,322 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:22:08,338 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_1232a.c[1656,1669] [2024-11-11 18:22:08,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:08,379 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:22:08,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08 WrapperNode [2024-11-11 18:22:08,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:08,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:08,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:22:08,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:22:08,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,432 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-11 18:22:08,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:08,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:22:08,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:22:08,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:22:08,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,476 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-11 18:22:08,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:22:08,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:22:08,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:22:08,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:22:08,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (1/1) ... [2024-11-11 18:22:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:08,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:22:08,523 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-11 18:22:08,526 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-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:22:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-11 18:22:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:22:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 18:22:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:22:08,643 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:22:08,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:22:08,845 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-11 18:22:08,845 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:22:08,862 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:22:08,862 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 18:22:08,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:08 BoogieIcfgContainer [2024-11-11 18:22:08,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:22:08,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:22:08,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:22:08,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:22:08,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:22:08" (1/3) ... [2024-11-11 18:22:08,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aa03bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:08, skipping insertion in model container [2024-11-11 18:22:08,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:08" (2/3) ... [2024-11-11 18:22:08,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76aa03bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:08, skipping insertion in model container [2024-11-11 18:22:08,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:08" (3/3) ... [2024-11-11 18:22:08,874 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-11 18:22:08,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:22:08,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:22:08,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:22:08,940 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;@35e83b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:22:08,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:22:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 18:22:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 18:22:08,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:08,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:08,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:08,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-11 18:22:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535932398] [2024-11-11 18:22:08,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,152 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-11 18:22:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535932398] [2024-11-11 18:22:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535932398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 18:22:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955639639] [2024-11-11 18:22:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 18:22:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 18:22:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 18:22:09,186 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 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-11 18:22:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,234 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-11 18:22:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 18:22:09,237 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-11 18:22:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,242 INFO L225 Difference]: With dead ends: 55 [2024-11-11 18:22:09,243 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 18:22:09,246 INFO L434 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-11 18:22:09,250 INFO L435 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-11 18:22:09,252 INFO L436 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-11 18:22:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 18:22:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 18:22:09,282 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-11 18:22:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-11 18:22:09,285 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-11 18:22:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,286 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-11 18:22:09,286 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-11 18:22:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-11 18:22:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:22:09,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 18:22:09,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-11 18:22:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598154150] [2024-11-11 18:22:09,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,582 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-11 18:22:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598154150] [2024-11-11 18:22:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598154150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347940652] [2024-11-11 18:22:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:09,589 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-11 18:22:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,633 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-11 18:22:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:09,634 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-11 18:22:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,637 INFO L225 Difference]: With dead ends: 39 [2024-11-11 18:22:09,637 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 18:22:09,638 INFO L434 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-11 18:22:09,639 INFO L435 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-11 18:22:09,642 INFO L436 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-11 18:22:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 18:22:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 18:22:09,651 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-11 18:22:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:09,653 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-11 18:22:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:09,654 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-11 18:22:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 18:22:09,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 18:22:09,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-11 18:22:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854180951] [2024-11-11 18:22:09,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,783 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-11 18:22:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854180951] [2024-11-11 18:22:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854180951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813560416] [2024-11-11 18:22:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:09,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:09,785 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-11 18:22:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,831 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:09,832 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-11 18:22:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,832 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:09,832 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:09,833 INFO L434 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-11 18:22:09,833 INFO L435 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-11 18:22:09,834 INFO L436 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-11 18:22:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:09,841 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-11 18:22:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:09,842 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-11 18:22:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,842 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:09,842 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-11 18:22:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 18:22:09,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 18:22:09,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-11 18:22:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:09,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590041518] [2024-11-11 18:22:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,915 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-11 18:22:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590041518] [2024-11-11 18:22:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590041518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287211710] [2024-11-11 18:22:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:09,918 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-11 18:22:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,949 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:09,950 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-11 18:22:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,951 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:09,951 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:09,951 INFO L434 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-11 18:22:09,952 INFO L435 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-11 18:22:09,952 INFO L436 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-11 18:22:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:09,959 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-11 18:22:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:09,960 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-11 18:22:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,961 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:09,961 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-11 18:22:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 18:22:09,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 18:22:09,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-11 18:22:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70978961] [2024-11-11 18:22:09,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,088 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-11 18:22:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:10,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70978961] [2024-11-11 18:22:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70978961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110065146] [2024-11-11 18:22:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:10,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:10,094 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-11 18:22:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:10,135 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:10,136 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-11 18:22:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:10,137 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:10,138 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:10,138 INFO L434 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-11 18:22:10,139 INFO L435 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-11 18:22:10,143 INFO L436 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-11 18:22:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:10,151 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-11 18:22:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:10,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-11 18:22:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:10,152 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-11 18:22:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 18:22:10,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 18:22:10,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-11 18:22:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251843064] [2024-11-11 18:22:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:10,187 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 18:22:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:10,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 18:22:10,232 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 18:22:10,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:22:10,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 18:22:10,240 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:10,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:22:10 BoogieIcfgContainer [2024-11-11 18:22:10,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:22:10,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:22:10,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:22:10,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:22:10,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:08" (3/4) ... [2024-11-11 18:22:10,262 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 18:22:10,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:22:10,263 INFO L158 Benchmark]: Toolchain (without parser) took 2139.71ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 84.6MB in the beginning and 140.4MB in the end (delta: -55.9MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:10,264 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:10,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.13ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 126.1MB in the end (delta: -41.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:10,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.79ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 124.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:10,264 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 124.4MB in the beginning and 209.8MB in the end (delta: -85.3MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-11 18:22:10,264 INFO L158 Benchmark]: RCFGBuilder took 372.51ms. Allocated memory is still 239.1MB. Free memory was 209.8MB in the beginning and 194.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 18:22:10,265 INFO L158 Benchmark]: TraceAbstraction took 1390.31ms. Allocated memory is still 239.1MB. Free memory was 193.0MB in the beginning and 140.4MB in the end (delta: 52.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-11-11 18:22:10,265 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 239.1MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:10,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.13ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 126.1MB in the end (delta: -41.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.79ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 124.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.18ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 124.4MB in the beginning and 209.8MB in the end (delta: -85.3MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * RCFGBuilder took 372.51ms. Allocated memory is still 239.1MB. Free memory was 209.8MB in the beginning and 194.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1390.31ms. Allocated memory is still 239.1MB. Free memory was 193.0MB in the beginning and 140.4MB in the end (delta: 52.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 239.1MB. Free memory is still 140.4MB. 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: 72]: 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 71, overapproximation of someUnaryFLOAToperation at line 67. Possible FailurePath: [L66] float x = 0.0f; [L67] float y = -0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L15] __uint32_t w; VAL [\old(x)=0, x=0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=4286578689, x=0] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=0, \result=0, x=0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0, y=4286578698] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=4286578698, x=0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=4286578698] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=4286578698] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s 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=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 18:22:10,289 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_1232a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:22:12,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:22:13,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 18:22:13,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:22:13,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:22:13,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:22:13,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:22:13,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:22:13,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:22:13,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:22:13,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:22:13,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:22:13,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:22:13,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:22:13,121 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:22:13,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:22:13,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:22:13,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:22:13,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:22:13,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:22:13,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:22:13,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:22:13,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:22:13,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 18:22:13,128 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 18:22:13,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:22:13,128 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 18:22:13,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:22:13,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:22:13,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:22:13,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:22:13,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:22:13,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:22:13,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:22:13,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:13,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:22:13,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:22:13,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:22:13,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 18:22:13,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 18:22:13,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:22:13,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:22:13,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:22:13,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:22:13,132 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-11-11 18:22:13,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:22:13,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:22:13,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:22:13,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:22:13,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:22:13,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-11 18:22:14,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:22:15,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:22:15,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-11 18:22:15,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5abd95ff/ad4d959bf3614d20b329e0007c576986/FLAG2bc50d391 [2024-11-11 18:22:15,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5abd95ff/ad4d959bf3614d20b329e0007c576986 [2024-11-11 18:22:15,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:22:15,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:22:15,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:15,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:22:15,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:22:15,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1484df4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15, skipping insertion in model container [2024-11-11 18:22:15,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:22:15,304 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_1232a.c[1656,1669] [2024-11-11 18:22:15,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:15,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:22:15,343 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_1232a.c[1656,1669] [2024-11-11 18:22:15,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:15,362 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:22:15,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15 WrapperNode [2024-11-11 18:22:15,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:15,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:15,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:22:15,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:22:15,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,394 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-11 18:22:15,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:15,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:22:15,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:22:15,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:22:15,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,430 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-11 18:22:15,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:22:15,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:22:15,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:22:15,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:22:15,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (1/1) ... [2024-11-11 18:22:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:22:15,504 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-11 18:22:15,517 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-11 18:22:15,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:22:15,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:22:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:22:15,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-11 18:22:15,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-11 18:22:15,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-11 18:22:15,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:22:15,644 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:22:15,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:22:15,860 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-11 18:22:15,860 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:22:15,872 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:22:15,873 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 18:22:15,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:15 BoogieIcfgContainer [2024-11-11 18:22:15,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:22:15,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:22:15,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:22:15,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:22:15,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:22:15" (1/3) ... [2024-11-11 18:22:15,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5c6879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:15, skipping insertion in model container [2024-11-11 18:22:15,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:15" (2/3) ... [2024-11-11 18:22:15,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5c6879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:15, skipping insertion in model container [2024-11-11 18:22:15,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:15" (3/3) ... [2024-11-11 18:22:15,886 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-11 18:22:15,904 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:22:15,904 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:22:15,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:22:15,973 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;@70282287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:22:15,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:22:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 18:22:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 18:22:15,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:15,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:15,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-11 18:22:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855588244] [2024-11-11 18:22:16,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:16,005 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-11 18:22:16,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:16,011 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-11 18:22:16,027 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-11 18:22:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:16,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 18:22:16,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:16,128 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-11 18:22:16,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:16,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855588244] [2024-11-11 18:22:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855588244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:16,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 18:22:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470728454] [2024-11-11 18:22:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 18:22:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 18:22:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:22:16,161 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 18:22:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:16,183 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-11 18:22:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 18:22:16,186 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-11 18:22:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:16,194 INFO L225 Difference]: With dead ends: 51 [2024-11-11 18:22:16,195 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 18:22:16,198 INFO L434 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-11 18:22:16,202 INFO L435 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-11 18:22:16,203 INFO L436 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-11 18:22:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 18:22:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 18:22:16,237 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-11 18:22:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-11 18:22:16,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-11 18:22:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:16,242 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-11 18:22:16,242 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-11 18:22:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-11 18:22:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 18:22:16,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:16,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:16,249 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-11 18:22:16,450 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-11 18:22:16,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-11 18:22:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788018944] [2024-11-11 18:22:16,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:16,452 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-11 18:22:16,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:16,455 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-11 18:22:16,650 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-11 18:22:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:16,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:16,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:16,783 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-11 18:22:16,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:16,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788018944] [2024-11-11 18:22:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788018944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305491205] [2024-11-11 18:22:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:16,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:16,789 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-11 18:22:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:16,815 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-11 18:22:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:16,815 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-11 18:22:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:16,817 INFO L225 Difference]: With dead ends: 36 [2024-11-11 18:22:16,817 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 18:22:16,818 INFO L434 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-11 18:22:16,818 INFO L435 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-11 18:22:16,819 INFO L436 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-11 18:22:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 18:22:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 18:22:16,827 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-11 18:22:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-11 18:22:16,829 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-11 18:22:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-11 18:22:16,830 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-11 18:22:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-11 18:22:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:22:16,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:16,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:16,835 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-11 18:22:17,034 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-11 18:22:17,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:17,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-11 18:22:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:17,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229272490] [2024-11-11 18:22:17,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:17,036 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-11 18:22:17,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:17,046 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-11 18:22:17,048 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-11 18:22:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:17,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 18:22:17,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:17,272 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-11 18:22:17,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:17,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229272490] [2024-11-11 18:22:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229272490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 18:22:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145480582] [2024-11-11 18:22:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 18:22:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 18:22:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 18:22:17,274 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-11 18:22:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:17,595 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-11 18:22:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 18:22:17,595 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-11 18:22:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:17,596 INFO L225 Difference]: With dead ends: 49 [2024-11-11 18:22:17,596 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 18:22:17,597 INFO L434 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-11 18:22:17,598 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:17,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 18:22:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 18:22:17,611 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-11 18:22:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-11 18:22:17,612 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-11 18:22:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:17,613 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-11 18:22:17,613 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-11 18:22:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-11 18:22:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 18:22:17,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:17,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:17,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:17,820 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-11 18:22:17,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:17,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-11 18:22:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281091460] [2024-11-11 18:22:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:17,825 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-11 18:22:17,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:17,831 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-11 18:22:17,834 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-11 18:22:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:17,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:17,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:17,908 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-11 18:22:17,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:17,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281091460] [2024-11-11 18:22:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281091460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460050344] [2024-11-11 18:22:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:17,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:17,917 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-11 18:22:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:17,980 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-11 18:22:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:17,980 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-11 18:22:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:17,981 INFO L225 Difference]: With dead ends: 36 [2024-11-11 18:22:17,981 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 18:22:17,981 INFO L434 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-11 18:22:17,982 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:17,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 18:22:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 18:22:17,994 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-11 18:22:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-11 18:22:17,995 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-11 18:22:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:17,995 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-11 18:22:17,995 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-11 18:22:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-11 18:22:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 18:22:17,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:17,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,005 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-11 18:22:18,200 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-11 18:22:18,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-11 18:22:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776703305] [2024-11-11 18:22:18,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:18,203 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-11 18:22:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:18,207 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-11 18:22:18,208 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-11 18:22:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:18,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 18:22:18,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:18,433 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-11 18:22:18,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:18,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776703305] [2024-11-11 18:22:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776703305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937219376] [2024-11-11 18:22:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:18,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:18,441 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-11 18:22:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:18,481 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-11 18:22:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:18,483 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-11 18:22:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:18,484 INFO L225 Difference]: With dead ends: 32 [2024-11-11 18:22:18,484 INFO L226 Difference]: Without dead ends: 29 [2024-11-11 18:22:18,484 INFO L434 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-11 18:22:18,486 INFO L435 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-11 18:22:18,487 INFO L436 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-11 18:22:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-11 18:22:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-11 18:22:18,490 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-11 18:22:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-11 18:22:18,491 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-11 18:22:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:18,491 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-11 18:22:18,491 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-11 18:22:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-11 18:22:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 18:22:18,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:18,695 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-11 18:22:18,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-11 18:22:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163318166] [2024-11-11 18:22:18,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:18,697 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-11 18:22:18,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:18,700 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-11 18:22:18,700 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-11 18:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:18,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 18:22:18,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:18,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 18:22:18,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 18:22:18,899 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-11 18:22:18,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:18,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:18,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163318166] [2024-11-11 18:22:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163318166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:18,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:18,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 18:22:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476758235] [2024-11-11 18:22:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:18,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 18:22:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 18:22:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 18:22:18,901 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-11 18:22:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:19,073 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-11 18:22:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 18:22:19,073 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-11 18:22:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:19,075 INFO L225 Difference]: With dead ends: 38 [2024-11-11 18:22:19,076 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 18:22:19,076 INFO L434 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-11 18:22:19,077 INFO L435 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-11 18:22:19,077 INFO L436 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-11 18:22:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 18:22:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 18:22:19,083 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-11 18:22:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-11 18:22:19,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-11 18:22:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:19,086 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-11 18:22:19,087 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-11 18:22:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-11 18:22:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 18:22:19,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:19,087 INFO L218 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-11 18:22:19,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:19,288 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-11 18:22:19,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-11 18:22:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:19,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326004871] [2024-11-11 18:22:19,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:19,293 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-11 18:22:19,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:19,295 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-11 18:22:19,297 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-11 18:22:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:19,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 18:22:19,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:19,582 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-11 18:22:19,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:19,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326004871] [2024-11-11 18:22:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326004871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:19,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:19,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 18:22:19,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218821871] [2024-11-11 18:22:19,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 18:22:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 18:22:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 18:22:19,585 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 18:22:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:19,639 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-11 18:22:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 18:22:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-11 18:22:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:19,640 INFO L225 Difference]: With dead ends: 21 [2024-11-11 18:22:19,640 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 18:22:19,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:19,641 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:19,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 18:22:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 18:22:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:22:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 18:22:19,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-11 18:22:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:19,643 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 18:22:19,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 18:22:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 18:22:19,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 18:22:19,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:22:19,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:19,846 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-11 18:22:19,850 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:19,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 18:22:19,993 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:20,013 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 18:22:20,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 18:22:20,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:22:20 BoogieIcfgContainer [2024-11-11 18:22:20,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:22:20,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:22:20,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:22:20,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:22:20,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:15" (3/4) ... [2024-11-11 18:22:20,021 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 18:22:20,025 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-11-11 18:22:20,028 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-11 18:22:20,028 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-11 18:22:20,028 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 18:22:20,029 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 18:22:20,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 18:22:20,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 18:22:20,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:22:20,098 INFO L158 Benchmark]: Toolchain (without parser) took 5003.59ms. Allocated memory was 75.5MB in the beginning and 127.9MB in the end (delta: 52.4MB). Free memory was 35.1MB in the beginning and 93.5MB in the end (delta: -58.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:20,098 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 75.5MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:20,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.59ms. Allocated memory is still 75.5MB. Free memory was 34.8MB in the beginning and 43.2MB in the end (delta: -8.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.23ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 41.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,098 INFO L158 Benchmark]: Boogie Preprocessor took 68.46ms. Allocated memory is still 75.5MB. Free memory was 41.6MB in the beginning and 39.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,099 INFO L158 Benchmark]: RCFGBuilder took 409.37ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 39.3MB in the beginning and 71.0MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,099 INFO L158 Benchmark]: TraceAbstraction took 4139.65ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 70.5MB in the beginning and 98.6MB in the end (delta: -28.1MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,099 INFO L158 Benchmark]: Witness Printer took 78.24ms. Allocated memory is still 127.9MB. Free memory was 98.6MB in the beginning and 93.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 18:22:20,100 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.08ms. Allocated memory is still 75.5MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.59ms. Allocated memory is still 75.5MB. Free memory was 34.8MB in the beginning and 43.2MB in the end (delta: -8.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.23ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 41.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.46ms. Allocated memory is still 75.5MB. Free memory was 41.6MB in the beginning and 39.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.37ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 39.3MB in the beginning and 71.0MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4139.65ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 70.5MB in the beginning and 98.6MB in the end (delta: -28.1MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 78.24ms. Allocated memory is still 127.9MB. Free memory was 98.6MB in the beginning and 93.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 167 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 38, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 6 QuantifiedInterpolants, 365 SizeOfPredicates, 11 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-11 18:22:20,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE