./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:52:12,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:52:12,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:52:12,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:52:12,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:52:12,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:52:12,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:52:12,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:52:12,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:52:12,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:52:12,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:52:12,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:52:12,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:52:12,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:52:12,311 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:52:12,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:52:12,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:52:12,312 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:52:12,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:52:12,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:52:12,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:52:12,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:52:12,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:52:12,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:52:12,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:52:12,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:52:12,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:52:12,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:52:12,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:52:12,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:52:12,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:52:12,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:52:12,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:52:12,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:52:12,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:52:12,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:52:12,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:52:12,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:52:12,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:52:12,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:52:12,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:52:12,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:52:12,334 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-09 20:52:12,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:52:12,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:52:12,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:52:12,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:52:12,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:52:12,639 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-09 20:52:14,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:52:14,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:52:14,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-09 20:52:14,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5639c6f3d/91e4e32ca6d343ee9f8763e8985f189e/FLAG303484bbb [2024-11-09 20:52:14,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5639c6f3d/91e4e32ca6d343ee9f8763e8985f189e [2024-11-09 20:52:14,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:52:14,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:52:14,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:52:14,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:52:14,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:52:14,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:14,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba10886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14, skipping insertion in model container [2024-11-09 20:52:14,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:14,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:52:14,902 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-09 20:52:14,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:52:14,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:52:14,943 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-09 20:52:14,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:52:14,966 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:52:14,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14 WrapperNode [2024-11-09 20:52:14,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:52:14,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:52:14,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:52:14,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:52:14,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:14,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:14,997 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-09 20:52:14,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:52:14,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:52:14,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:52:14,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:52:15,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,026 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-09 20:52:15,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:52:15,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:52:15,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:52:15,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:52:15,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (1/1) ... [2024-11-09 20:52:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:52:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:52:15,081 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-09 20:52:15,086 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-09 20:52:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:52:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:52:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 20:52:15,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 20:52:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 20:52:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-09 20:52:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-09 20:52:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 20:52:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 20:52:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 20:52:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:52:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:52:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 20:52:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 20:52:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 20:52:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 20:52:15,201 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:52:15,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:52:15,427 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 20:52:15,427 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:52:15,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:52:15,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:52:15,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:15 BoogieIcfgContainer [2024-11-09 20:52:15,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:52:15,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:52:15,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:52:15,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:52:15,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:52:14" (1/3) ... [2024-11-09 20:52:15,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc56311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:52:15, skipping insertion in model container [2024-11-09 20:52:15,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:14" (2/3) ... [2024-11-09 20:52:15,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc56311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:52:15, skipping insertion in model container [2024-11-09 20:52:15,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:15" (3/3) ... [2024-11-09 20:52:15,461 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-09 20:52:15,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:52:15,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:52:15,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:52:15,548 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;@4e79af26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:52:15,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:52:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 20:52:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 20:52:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:15,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:15,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 281430993, now seen corresponding path program 1 times [2024-11-09 20:52:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941131960] [2024-11-09 20:52:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 20:52:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:15,767 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-09 20:52:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:52:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941131960] [2024-11-09 20:52:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941131960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:15,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:15,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:52:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693888341] [2024-11-09 20:52:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:15,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:52:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:52:15,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:52:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:52:15,795 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:52:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:15,827 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2024-11-09 20:52:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:52:15,829 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-09 20:52:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:15,835 INFO L225 Difference]: With dead ends: 56 [2024-11-09 20:52:15,835 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 20:52:15,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:52:15,840 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:15,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 20:52:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 20:52:15,870 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-09 20:52:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-09 20:52:15,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-09 20:52:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-09 20:52:15,873 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-09 20:52:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-09 20:52:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:52:15,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:15,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:52:15,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash -34966834, now seen corresponding path program 1 times [2024-11-09 20:52:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476400956] [2024-11-09 20:52:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 20:52:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,124 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-09 20:52:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:52:16,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476400956] [2024-11-09 20:52:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476400956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:16,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:16,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:52:16,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061349171] [2024-11-09 20:52:16,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:16,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:52:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:52:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:52:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,131 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-09 20:52:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:16,182 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 20:52:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:52:16,184 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-09 20:52:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:16,187 INFO L225 Difference]: With dead ends: 39 [2024-11-09 20:52:16,188 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 20:52:16,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,190 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:16,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 20:52:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 20:52:16,201 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-09 20:52:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 20:52:16,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-09 20:52:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:16,203 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 20:52:16,203 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-09 20:52:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 20:52:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 20:52:16,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:16,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:16,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:52:16,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -366289900, now seen corresponding path program 1 times [2024-11-09 20:52:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133662649] [2024-11-09 20:52:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 20:52:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,431 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-09 20:52:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:52:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133662649] [2024-11-09 20:52:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133662649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:52:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573530725] [2024-11-09 20:52:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:16,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:52:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:52:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:52:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,435 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-09 20:52:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:16,487 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 20:52:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:52:16,487 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-09 20:52:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:16,488 INFO L225 Difference]: With dead ends: 43 [2024-11-09 20:52:16,488 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 20:52:16,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,490 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:16,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 20:52:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-09 20:52:16,497 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-09 20:52:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 20:52:16,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-09 20:52:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:16,499 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 20:52:16,499 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-09 20:52:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 20:52:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 20:52:16,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:16,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 20:52:16,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 833169489, now seen corresponding path program 1 times [2024-11-09 20:52:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:16,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976921854] [2024-11-09 20:52:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 20:52:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,634 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-09 20:52:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:52:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976921854] [2024-11-09 20:52:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976921854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:16,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:52:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670385574] [2024-11-09 20:52:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:16,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:52:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:52:16,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:52:16,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,638 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-09 20:52:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:16,684 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 20:52:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:52:16,685 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-09 20:52:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:16,686 INFO L225 Difference]: With dead ends: 43 [2024-11-09 20:52:16,686 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 20:52:16,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,688 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:16,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 20:52:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-09 20:52:16,697 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-09 20:52:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 20:52:16,699 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-09 20:52:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 20:52:16,700 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-09 20:52:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 20:52:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 20:52:16,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:16,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 20:52:16,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2052722569, now seen corresponding path program 1 times [2024-11-09 20:52:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768082094] [2024-11-09 20:52:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 20:52:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:16,849 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-09 20:52:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:52:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768082094] [2024-11-09 20:52:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768082094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:16,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:52:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775646460] [2024-11-09 20:52:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:52:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:52:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:52:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,854 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-09 20:52:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:16,896 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 20:52:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:52:16,898 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-09 20:52:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:16,898 INFO L225 Difference]: With dead ends: 43 [2024-11-09 20:52:16,898 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 20:52:16,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:16,900 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:16,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 20:52:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-09 20:52:16,908 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-09 20:52:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 20:52:16,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-09 20:52:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 20:52:16,910 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-09 20:52:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 20:52:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 20:52:16,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:16,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 20:52:16,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 434790264, now seen corresponding path program 1 times [2024-11-09 20:52:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:52:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991828639] [2024-11-09 20:52:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:52:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:52:16,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 20:52:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:52:16,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 20:52:16,978 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 20:52:16,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 20:52:16,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 20:52:16,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 20:52:17,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:52:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:52:17 BoogieIcfgContainer [2024-11-09 20:52:17,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:52:17,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:52:17,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:52:17,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:52:17,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:15" (3/4) ... [2024-11-09 20:52:17,023 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 20:52:17,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:52:17,025 INFO L158 Benchmark]: Toolchain (without parser) took 2376.14ms. Allocated memory was 180.4MB in the beginning and 276.8MB in the end (delta: 96.5MB). Free memory was 123.8MB in the beginning and 190.2MB in the end (delta: -66.4MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-09 20:52:17,026 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:52:17,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.64ms. Allocated memory is still 180.4MB. Free memory was 123.8MB in the beginning and 109.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:52:17,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.88ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 107.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:52:17,027 INFO L158 Benchmark]: Boogie Preprocessor took 44.05ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 106.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:52:17,027 INFO L158 Benchmark]: IcfgBuilder took 404.64ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 91.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:52:17,028 INFO L158 Benchmark]: TraceAbstraction took 1567.58ms. Allocated memory was 180.4MB in the beginning and 276.8MB in the end (delta: 96.5MB). Free memory was 90.7MB in the beginning and 190.2MB in the end (delta: -99.5MB). Peak memory consumption was 746.9kB. Max. memory is 16.1GB. [2024-11-09 20:52:17,028 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 276.8MB. Free memory is still 190.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:52:17,032 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.20ms. Allocated memory is still 180.4MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.64ms. Allocated memory is still 180.4MB. Free memory was 123.8MB in the beginning and 109.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.88ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 107.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.05ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 106.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 404.64ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 91.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1567.58ms. Allocated memory was 180.4MB in the beginning and 276.8MB in the end (delta: 96.5MB). Free memory was 90.7MB in the beginning and 190.2MB in the end (delta: -99.5MB). Peak memory consumption was 746.9kB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 276.8MB. Free memory is still 190.2MB. 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 [L21] COND FALSE !(0) VAL [\old(x)=0, w=4286578689, x=0] [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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, 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.2s 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=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s 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-09 20:52:17,063 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:52:19,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:52:19,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:52:19,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:52:19,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:52:19,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:52:19,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:52:19,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:52:19,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:52:19,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:52:19,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:52:19,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:52:19,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:52:19,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:52:19,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:52:19,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:52:19,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:52:19,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:52:19,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:52:19,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:52:19,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:52:19,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:52:19,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:52:19,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:52:19,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:52:19,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:52:19,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:52:19,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:52:19,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:52:19,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:52:19,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:52:19,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:52:19,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:52:19,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:52:19,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:52:19,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:52:19,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:52:19,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:52:19,376 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:52:19,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:52:19,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:52:19,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:52:19,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:52:19,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:52:19,378 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-09 20:52:19,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:52:19,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:52:19,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:52:19,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:52:19,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:52:19,728 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-09 20:52:21,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:52:21,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:52:21,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-09 20:52:21,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae12c783/8ad60c4efd6f431187f95d2805a0b88c/FLAGea85842df [2024-11-09 20:52:21,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae12c783/8ad60c4efd6f431187f95d2805a0b88c [2024-11-09 20:52:21,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:52:21,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:52:21,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:52:21,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:52:21,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:52:21,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:52:21" (1/1) ... [2024-11-09 20:52:21,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51afd4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:21, skipping insertion in model container [2024-11-09 20:52:21,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:52:21" (1/1) ... [2024-11-09 20:52:21,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:52:22,123 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-09 20:52:22,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:52:22,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:52:22,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2024-11-09 20:52:22,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:52:22,198 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:52:22,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22 WrapperNode [2024-11-09 20:52:22,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:52:22,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:52:22,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:52:22,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:52:22,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,247 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-09 20:52:22,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:52:22,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:52:22,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:52:22,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:52:22,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,286 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-09 20:52:22,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:52:22,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:52:22,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:52:22,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:52:22,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (1/1) ... [2024-11-09 20:52:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:52:22,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:52:22,373 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-09 20:52:22,380 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-09 20:52:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:52:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:52:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 20:52:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 20:52:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 20:52:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-09 20:52:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-09 20:52:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 20:52:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:52:22,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 20:52:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 20:52:22,530 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:52:22,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:52:22,766 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 20:52:22,766 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:52:22,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:52:22,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:52:22,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:22 BoogieIcfgContainer [2024-11-09 20:52:22,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:52:22,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:52:22,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:52:22,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:52:22,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:52:21" (1/3) ... [2024-11-09 20:52:22,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3351b198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:52:22, skipping insertion in model container [2024-11-09 20:52:22,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:52:22" (2/3) ... [2024-11-09 20:52:22,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3351b198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:52:22, skipping insertion in model container [2024-11-09 20:52:22,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:22" (3/3) ... [2024-11-09 20:52:22,796 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-09 20:52:22,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:52:22,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:52:22,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:52:22,877 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;@cc099ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:52:22,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:52:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 20:52:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 20:52:22,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:22,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:22,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:22,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 130515667, now seen corresponding path program 1 times [2024-11-09 20:52:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840327012] [2024-11-09 20:52:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:22,920 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-09 20:52:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:22,924 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-09 20:52:22,925 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-09 20:52:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:23,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 20:52:23,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:23,042 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-09 20:52:23,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:23,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840327012] [2024-11-09 20:52:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840327012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:52:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315839188] [2024-11-09 20:52:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 20:52:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 20:52:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 20:52:23,075 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:52:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:23,098 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2024-11-09 20:52:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 20:52:23,100 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-09 20:52:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:23,107 INFO L225 Difference]: With dead ends: 52 [2024-11-09 20:52:23,107 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 20:52:23,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 20:52:23,113 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:23,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 20:52:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 20:52:23,146 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-09 20:52:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-09 20:52:23,148 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-09 20:52:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:23,149 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 20:52:23,149 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-09 20:52:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-09 20:52:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 20:52:23,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:23,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:23,156 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-09 20:52:23,352 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-09 20:52:23,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1908286854, now seen corresponding path program 1 times [2024-11-09 20:52:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473547835] [2024-11-09 20:52:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:23,354 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-09 20:52:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:23,358 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-09 20:52:23,359 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-09 20:52:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:23,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:52:23,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:23,480 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-09 20:52:23,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:23,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473547835] [2024-11-09 20:52:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473547835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:52:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311124121] [2024-11-09 20:52:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:23,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:52:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:52:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:52:23,487 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-09 20:52:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:23,515 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-09 20:52:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:52:23,517 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-09 20:52:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:23,520 INFO L225 Difference]: With dead ends: 36 [2024-11-09 20:52:23,520 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 20:52:23,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:52:23,522 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:23,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 20:52:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 20:52:23,530 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-09 20:52:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-09 20:52:23,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-09 20:52:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:23,534 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-09 20:52:23,535 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-09 20:52:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-09 20:52:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:52:23,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:23,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:23,540 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-09 20:52:23,736 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-09 20:52:23,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:23,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1627871568, now seen corresponding path program 1 times [2024-11-09 20:52:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089008130] [2024-11-09 20:52:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:23,739 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-09 20:52:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:23,740 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-09 20:52:23,741 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-09 20:52:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:23,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 20:52:23,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:23,945 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-09 20:52:23,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:23,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:23,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089008130] [2024-11-09 20:52:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089008130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:23,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:52:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115316630] [2024-11-09 20:52:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:52:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:52:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:52:23,948 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-09 20:52:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:24,140 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-09 20:52:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:52:24,141 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-09 20:52:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:24,142 INFO L225 Difference]: With dead ends: 49 [2024-11-09 20:52:24,142 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 20:52:24,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 20:52:24,143 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:24,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:52:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 20:52:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 20:52:24,148 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-09 20:52:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-09 20:52:24,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-09 20:52:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:24,149 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-09 20:52:24,150 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-09 20:52:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-09 20:52:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 20:52:24,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:24,151 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:24,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 20:52:24,351 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-09 20:52:24,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -8599178, now seen corresponding path program 1 times [2024-11-09 20:52:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609678672] [2024-11-09 20:52:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:24,353 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-09 20:52:24,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:24,356 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-09 20:52:24,359 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-09 20:52:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:24,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:52:24,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:24,451 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-09 20:52:24,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:24,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609678672] [2024-11-09 20:52:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609678672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:24,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:52:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312650221] [2024-11-09 20:52:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:52:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:52:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:52:24,458 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-09 20:52:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:24,495 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-09 20:52:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:52:24,496 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-09 20:52:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:24,496 INFO L225 Difference]: With dead ends: 36 [2024-11-09 20:52:24,497 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 20:52:24,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:52:24,498 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:24,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 20:52:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 20:52:24,507 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-09 20:52:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-09 20:52:24,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-09 20:52:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-09 20:52:24,509 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-09 20:52:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-09 20:52:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 20:52:24,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:24,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:24,517 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-09 20:52:24,710 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-09 20:52:24,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash -6752136, now seen corresponding path program 1 times [2024-11-09 20:52:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069056325] [2024-11-09 20:52:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:24,711 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-09 20:52:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:24,713 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-09 20:52:24,714 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-09 20:52:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:24,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 20:52:24,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:24,829 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-09 20:52:24,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:24,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069056325] [2024-11-09 20:52:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069056325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:24,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:24,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:52:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171042258] [2024-11-09 20:52:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:52:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:52:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:24,831 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-09 20:52:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:24,860 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-09 20:52:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:52:24,860 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-09 20:52:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:24,861 INFO L225 Difference]: With dead ends: 32 [2024-11-09 20:52:24,861 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 20:52:24,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:52:24,862 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:24,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:52:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 20:52:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 20:52:24,866 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-09 20:52:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-09 20:52:24,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-09 20:52:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-09 20:52:24,867 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-09 20:52:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-09 20:52:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 20:52:24,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:24,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:24,874 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-09 20:52:25,071 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-09 20:52:25,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:25,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1010818546, now seen corresponding path program 1 times [2024-11-09 20:52:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265682325] [2024-11-09 20:52:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:25,073 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-09 20:52:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:25,076 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-09 20:52:25,077 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-09 20:52:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:25,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 20:52:25,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:25,173 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-09 20:52:25,176 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-09 20:52:25,248 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-09 20:52:25,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:25,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265682325] [2024-11-09 20:52:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265682325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:52:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169704045] [2024-11-09 20:52:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:52:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:52:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:52:25,252 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-09 20:52:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:25,393 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-09 20:52:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:52:25,394 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-09 20:52:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:25,395 INFO L225 Difference]: With dead ends: 38 [2024-11-09 20:52:25,395 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 20:52:25,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 20:52:25,396 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:52:25,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:52:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 20:52:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 20:52:25,399 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-09 20:52:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 20:52:25,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-09 20:52:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:25,400 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 20:52:25,400 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-09 20:52:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 20:52:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 20:52:25,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:52:25,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:25,405 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-09 20:52:25,601 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-09 20:52:25,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:52:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:52:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -98084589, now seen corresponding path program 1 times [2024-11-09 20:52:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:52:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610158884] [2024-11-09 20:52:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:52:25,603 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-09 20:52:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:52:25,606 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-09 20:52:25,610 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-09 20:52:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:52:25,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 20:52:25,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:52:25,896 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-09 20:52:25,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:52:25,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:52:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610158884] [2024-11-09 20:52:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610158884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:52:25,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:52:25,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 20:52:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615156977] [2024-11-09 20:52:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:52:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 20:52:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:52:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 20:52:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 20:52:25,899 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-09 20:52:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:52:25,978 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-09 20:52:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 20:52:25,979 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-09 20:52:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:52:25,980 INFO L225 Difference]: With dead ends: 21 [2024-11-09 20:52:25,980 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 20:52:25,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 20:52:25,981 INFO L432 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-09 20:52:25,981 INFO L433 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-09 20:52:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 20:52:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 20:52:25,982 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-09 20:52:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 20:52:25,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-09 20:52:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:52:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 20:52:25,982 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-09 20:52:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 20:52:25,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 20:52:25,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 20:52:25,992 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-09 20:52:26,187 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-09 20:52:26,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:52:26,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 20:52:26,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:52:26,317 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 20:52:26,318 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 20:52:26,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:52:26 BoogieIcfgContainer [2024-11-09 20:52:26,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:52:26,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:52:26,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:52:26,324 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:52:26,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:52:22" (3/4) ... [2024-11-09 20:52:26,328 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 20:52:26,332 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-11-09 20:52:26,337 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-09 20:52:26,337 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 20:52:26,338 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 20:52:26,338 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 20:52:26,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 20:52:26,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 20:52:26,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:52:26,412 INFO L158 Benchmark]: Toolchain (without parser) took 4551.84ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 48.8MB in the beginning and 41.3MB in the end (delta: 7.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,412 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 48.2MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:52:26,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.96ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 34.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.88ms. Allocated memory is still 69.2MB. Free memory was 34.9MB in the beginning and 33.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,413 INFO L158 Benchmark]: Boogie Preprocessor took 69.06ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 31.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,413 INFO L158 Benchmark]: IcfgBuilder took 467.67ms. Allocated memory is still 69.2MB. Free memory was 30.9MB in the beginning and 36.4MB in the end (delta: -5.4MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,413 INFO L158 Benchmark]: TraceAbstraction took 3534.56ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 35.8MB in the beginning and 46.1MB in the end (delta: -10.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,413 INFO L158 Benchmark]: Witness Printer took 87.82ms. Allocated memory is still 86.0MB. Free memory was 46.1MB in the beginning and 41.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 20:52:26,415 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.86ms. Allocated memory is still 48.2MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.96ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 34.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.88ms. Allocated memory is still 69.2MB. Free memory was 34.9MB in the beginning and 33.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.06ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 31.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 467.67ms. Allocated memory is still 69.2MB. Free memory was 30.9MB in the beginning and 36.4MB in the end (delta: -5.4MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3534.56ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 35.8MB in the beginning and 46.1MB in the end (delta: -10.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 87.82ms. Allocated memory is still 86.0MB. Free memory was 46.1MB in the beginning and 41.3MB in the end (delta: 4.8MB). 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.3s 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.3s 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 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: 49]: Location Invariant Derived location invariant: null - InvariantResult [Line: 17]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 20:52:26,444 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