./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.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 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:21:56,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:21:56,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 18:21:56,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:21:56,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:21:56,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:21:56,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:21:56,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:21:56,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:21:56,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:21:56,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:21:56,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:21:56,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:21:56,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:21:56,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:21:56,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:21:56,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:21:56,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:21:56,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 18:21:56,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:21:56,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:21:56,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:21:56,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:21:56,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:21:56,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:21:56,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:21:56,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:21:56,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:21:56,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:21:56,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:21:56,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:21:56,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:21:56,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:21:56,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:21:56,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:21:56,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:21:56,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 18:21:56,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 18:21:56,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:21:56,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:21:56,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:21:56,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:21:56,527 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 -> 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 [2024-11-11 18:21:56,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:21:56,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:21:56,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:21:56,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:21:56,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:21:56,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-11-11 18:21:58,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:21:58,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:21:58,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-11-11 18:21:58,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796b86096/cacad6f8a5f64e52beec398da92dc8ab/FLAG54a097fb0 [2024-11-11 18:21:58,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796b86096/cacad6f8a5f64e52beec398da92dc8ab [2024-11-11 18:21:58,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:21:58,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:21:58,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:21:58,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:21:58,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:21:58,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:21:58" (1/1) ... [2024-11-11 18:21:58,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0e7045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:58, skipping insertion in model container [2024-11-11 18:21:58,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:21:58" (1/1) ... [2024-11-11 18:21:58,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:21:58,956 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_1231.c[1835,1848] [2024-11-11 18:21:58,965 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_1231.c[1994,2007] [2024-11-11 18:21:58,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:21:58,976 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:21:58,998 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_1231.c[1835,1848] [2024-11-11 18:21:59,000 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_1231.c[1994,2007] [2024-11-11 18:21:59,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:21:59,023 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:21:59,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59 WrapperNode [2024-11-11 18:21:59,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:21:59,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:21:59,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:21:59,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:21:59,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,068 INFO L138 Inliner]: procedures = 19, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-11 18:21:59,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:21:59,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:21:59,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:21:59,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:21:59,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,109 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-11 18:21:59,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:21:59,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:21:59,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:21:59,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:21:59,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (1/1) ... [2024-11-11 18:21:59,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:21:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:21:59,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 18:21:59,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 18:21:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:21:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 18:21:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 18:21:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:21:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:21:59,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:21:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-11 18:21:59,223 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:21:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 18:21:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:21:59,324 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:21:59,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:21:59,596 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-11 18:21:59,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:21:59,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:21:59,619 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 18:21:59,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:21:59 BoogieIcfgContainer [2024-11-11 18:21:59,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:21:59,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:21:59,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:21:59,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:21:59,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:21:58" (1/3) ... [2024-11-11 18:21:59,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d198813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:21:59, skipping insertion in model container [2024-11-11 18:21:59,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:21:59" (2/3) ... [2024-11-11 18:21:59,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d198813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:21:59, skipping insertion in model container [2024-11-11 18:21:59,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:21:59" (3/3) ... [2024-11-11 18:21:59,628 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2024-11-11 18:21:59,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:21:59,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 18:21:59,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:21:59,715 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;@25512f36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:21:59,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 18:21:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 42 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 18:21:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 18:21:59,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:21:59,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:21:59,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:21:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:21:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 601066810, now seen corresponding path program 1 times [2024-11-11 18:21:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:21:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588699225] [2024-11-11 18:21:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:21:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:21:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:21:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:21:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 18:22:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 18:22:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588699225] [2024-11-11 18:22:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588699225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:00,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820900044] [2024-11-11 18:22:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:00,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:00,111 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 42 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:00,276 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2024-11-11 18:22:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-11 18:22:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:00,291 INFO L225 Difference]: With dead ends: 97 [2024-11-11 18:22:00,292 INFO L226 Difference]: Without dead ends: 53 [2024-11-11 18:22:00,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:00,304 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:00,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 226 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-11 18:22:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-11 18:22:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 18:22:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-11 18:22:00,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 28 [2024-11-11 18:22:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:00,344 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-11 18:22:00,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-11 18:22:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 18:22:00,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:00,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 18:22:00,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 246404667, now seen corresponding path program 1 times [2024-11-11 18:22:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965824095] [2024-11-11 18:22:00,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 18:22:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 18:22:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 18:22:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 18:22:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965824095] [2024-11-11 18:22:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965824095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024106097] [2024-11-11 18:22:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:00,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:00,691 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:00,819 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2024-11-11 18:22:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-11 18:22:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:00,823 INFO L225 Difference]: With dead ends: 77 [2024-11-11 18:22:00,825 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 18:22:00,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:00,827 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:00,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 212 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 18:22:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-11 18:22:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-11 18:22:00,841 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 34 [2024-11-11 18:22:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-11 18:22:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-11 18:22:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 18:22:00,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:00,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:00,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 18:22:00,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:00,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1526150318, now seen corresponding path program 1 times [2024-11-11 18:22:00,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288902297] [2024-11-11 18:22:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 18:22:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 18:22:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 18:22:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 18:22:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288902297] [2024-11-11 18:22:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288902297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602485208] [2024-11-11 18:22:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:01,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,172 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:01,267 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-11 18:22:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:01,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-11 18:22:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:01,270 INFO L225 Difference]: With dead ends: 81 [2024-11-11 18:22:01,270 INFO L226 Difference]: Without dead ends: 61 [2024-11-11 18:22:01,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,271 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:01,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-11 18:22:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-11 18:22:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-11 18:22:01,281 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 35 [2024-11-11 18:22:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-11 18:22:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-11 18:22:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 18:22:01,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:01,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:01,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 18:22:01,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:01,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1631952791, now seen corresponding path program 1 times [2024-11-11 18:22:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069261866] [2024-11-11 18:22:01,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 18:22:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 18:22:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 18:22:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 18:22:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069261866] [2024-11-11 18:22:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069261866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496212129] [2024-11-11 18:22:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,480 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:01,578 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-11 18:22:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:01,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-11 18:22:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:01,582 INFO L225 Difference]: With dead ends: 81 [2024-11-11 18:22:01,583 INFO L226 Difference]: Without dead ends: 61 [2024-11-11 18:22:01,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,584 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:01,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-11 18:22:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-11 18:22:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-11 18:22:01,600 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 36 [2024-11-11 18:22:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:01,604 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-11 18:22:01,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-11 18:22:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 18:22:01,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:01,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 18:22:01,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:01,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1273333138, now seen corresponding path program 1 times [2024-11-11 18:22:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:01,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065558120] [2024-11-11 18:22:01,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 18:22:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 18:22:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 18:22:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 18:22:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:01,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065558120] [2024-11-11 18:22:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065558120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615174190] [2024-11-11 18:22:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:01,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,767 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:01,859 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-11 18:22:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-11 18:22:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:01,860 INFO L225 Difference]: With dead ends: 81 [2024-11-11 18:22:01,861 INFO L226 Difference]: Without dead ends: 61 [2024-11-11 18:22:01,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:01,862 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:01,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-11 18:22:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-11 18:22:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-11 18:22:01,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 37 [2024-11-11 18:22:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:01,880 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-11 18:22:01,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-11 18:22:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 18:22:01,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:01,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 18:22:01,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1778891763, now seen corresponding path program 1 times [2024-11-11 18:22:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218257935] [2024-11-11 18:22:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 18:22:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 18:22:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 18:22:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 18:22:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:01,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218257935] [2024-11-11 18:22:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218257935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817198076] [2024-11-11 18:22:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:01,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:01,974 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 18:22:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:02,040 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-11-11 18:22:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-11 18:22:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:02,042 INFO L225 Difference]: With dead ends: 60 [2024-11-11 18:22:02,043 INFO L226 Difference]: Without dead ends: 58 [2024-11-11 18:22:02,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:02,044 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:02,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-11 18:22:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-11 18:22:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-11 18:22:02,058 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 37 [2024-11-11 18:22:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:02,059 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-11 18:22:02,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 18:22:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-11 18:22:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 18:22:02,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:02,064 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 18:22:02,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1941560781, now seen corresponding path program 1 times [2024-11-11 18:22:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681087658] [2024-11-11 18:22:02,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:02,092 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 18:22:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:02,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 18:22:02,146 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 18:22:02,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-11 18:22:02,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-11 18:22:02,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 18:22:02,153 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:02,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:02,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:22:02 BoogieIcfgContainer [2024-11-11 18:22:02,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:22:02,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:22:02,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:22:02,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:22:02,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:21:59" (3/4) ... [2024-11-11 18:22:02,198 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 18:22:02,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:22:02,200 INFO L158 Benchmark]: Toolchain (without parser) took 3508.84ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 141.7MB in the beginning and 82.4MB in the end (delta: 59.3MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,200 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:02,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.95ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 133.8MB in the end (delta: 7.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.78ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,203 INFO L158 Benchmark]: Boogie Preprocessor took 55.36ms. Allocated memory is still 174.1MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,203 INFO L158 Benchmark]: RCFGBuilder took 494.06ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 133.8MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,204 INFO L158 Benchmark]: TraceAbstraction took 2571.22ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 132.8MB in the beginning and 82.4MB in the end (delta: 50.4MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:02,204 INFO L158 Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 209.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:02,205 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.95ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 133.8MB in the end (delta: 7.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.78ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.36ms. Allocated memory is still 174.1MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.06ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 133.8MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2571.22ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 132.8MB in the beginning and 82.4MB in the end (delta: 50.4MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 5.43ms. Allocated memory is still 209.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: 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 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L70] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L59] return x != x; VAL [\old(x)=4286578699, \result=1] [L70] RET, EXPR isnan_float(x) VAL [x=4286578699] [L70] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699] [L70] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L59] return x != x; VAL [\old(x)=4286578698, \result=0] [L70] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L70] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=4286578699, y=4286578698] [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L73] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578699] [L15] __uint32_t w; VAL [\old(x)=4286578699, x=4286578699] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=4286578699, \result=0, x=4286578699] [L38] RET, EXPR __fpclassify_float(x) VAL [x=4286578699, y=4286578698] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=4286578698, x=4286578699] [L73] RET, EXPR fmin_float(x, y) [L73] float res = fmin_float(x, y); [L76] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L59] return x != x; VAL [\old(x)=4286578699, \result=1] [L76] RET, EXPR isnan_float(x) VAL [x=4286578699, y=4286578698] [L76] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L76] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L59] return x != x; VAL [\old(x)=4286578698, \result=0] [L76] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L76] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L77] reach_error() VAL [x=4286578699, y=4286578698] - UnprovableResult [Line: 83]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 405 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 18:22:02,239 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_1231.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 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:22:04,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:22:04,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 18:22:04,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:22:04,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:22:04,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:22:04,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:22:04,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:22:04,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:22:04,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:22:04,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:22:04,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:22:04,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:22:04,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:22:04,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:22:04,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:22:04,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:22:04,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:22:04,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:22:04,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:22:04,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:22:04,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:22:04,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:22:04,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 18:22:04,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 18:22:04,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:22:04,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 18:22:04,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:22:04,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:22:04,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:22:04,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:22:04,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:22:04,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:22:04,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:22:04,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:04,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:22:04,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:22:04,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:22:04,933 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 18:22:04,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 18:22:04,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:22:04,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:22:04,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:22:04,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:22:04,937 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 -> 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 [2024-11-11 18:22:05,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:22:05,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:22:05,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:22:05,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:22:05,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:22:05,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-11-11 18:22:06,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:22:07,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:22:07,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-11-11 18:22:07,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13000f26a/fb80df5926824e82a9ee01d48c16049b/FLAG032271867 [2024-11-11 18:22:07,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13000f26a/fb80df5926824e82a9ee01d48c16049b [2024-11-11 18:22:07,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:22:07,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:22:07,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:07,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:22:07,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:22:07,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913c44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07, skipping insertion in model container [2024-11-11 18:22:07,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:22:07,527 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_1231.c[1835,1848] [2024-11-11 18:22:07,536 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_1231.c[1994,2007] [2024-11-11 18:22:07,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:07,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:22:07,588 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_1231.c[1835,1848] [2024-11-11 18:22:07,592 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_1231.c[1994,2007] [2024-11-11 18:22:07,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:07,630 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:22:07,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07 WrapperNode [2024-11-11 18:22:07,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:07,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:07,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:22:07,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:22:07,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,679 INFO L138 Inliner]: procedures = 22, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-11-11 18:22:07,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:07,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:22:07,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:22:07,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:22:07,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,731 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-11 18:22:07,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:22:07,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:22:07,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:22:07,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:22:07,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (1/1) ... [2024-11-11 18:22:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:07,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:22:07,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 18:22:07,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 18:22:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:22:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 18:22:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 18:22:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:22:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:22:07,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:22:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-11 18:22:07,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-11 18:22:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 18:22:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 18:22:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:22:07,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:22:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-11 18:22:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-11 18:22:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:22:07,946 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:22:07,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:22:08,280 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-11 18:22:08,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:22:08,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:22:08,302 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 18:22:08,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:08 BoogieIcfgContainer [2024-11-11 18:22:08,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:22:08,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:22:08,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:22:08,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:22:08,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:22:07" (1/3) ... [2024-11-11 18:22:08,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d71700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:08, skipping insertion in model container [2024-11-11 18:22:08,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:07" (2/3) ... [2024-11-11 18:22:08,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d71700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:08, skipping insertion in model container [2024-11-11 18:22:08,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:08" (3/3) ... [2024-11-11 18:22:08,315 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2024-11-11 18:22:08,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:22:08,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 18:22:08,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:22:08,444 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;@1c925b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:22:08,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 18:22:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 18:22:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 18:22:08,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:08,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:08,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1842866032, now seen corresponding path program 1 times [2024-11-11 18:22:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493623086] [2024-11-11 18:22:08,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:08,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:08,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 18:22:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:08,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 18:22:08,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:22:08,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:08,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493623086] [2024-11-11 18:22:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493623086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 18:22:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849305468] [2024-11-11 18:22:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 18:22:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 18:22:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:22:08,697 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:08,727 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2024-11-11 18:22:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 18:22:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-11 18:22:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:08,739 INFO L225 Difference]: With dead ends: 89 [2024-11-11 18:22:08,739 INFO L226 Difference]: Without dead ends: 49 [2024-11-11 18:22:08,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:22:08,749 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:08,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-11 18:22:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-11 18:22:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 18:22:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-11 18:22:08,821 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 27 [2024-11-11 18:22:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:08,824 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-11 18:22:08,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-11 18:22:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 18:22:08,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:08,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:08,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 18:22:09,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash -207460078, now seen corresponding path program 1 times [2024-11-11 18:22:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:09,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726916008] [2024-11-11 18:22:09,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:09,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:09,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 18:22:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:09,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:22:09,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:09,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726916008] [2024-11-11 18:22:09,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726916008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280526439] [2024-11-11 18:22:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:09,213 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,263 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-11-11 18:22:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:09,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-11 18:22:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,270 INFO L225 Difference]: With dead ends: 85 [2024-11-11 18:22:09,270 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 18:22:09,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:09,272 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:09,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 18:22:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-11 18:22:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 18:22:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-11 18:22:09,288 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2024-11-11 18:22:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-11 18:22:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 18:22:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-11 18:22:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 18:22:09,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 18:22:09,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 318152461, now seen corresponding path program 1 times [2024-11-11 18:22:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396739866] [2024-11-11 18:22:09,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:09,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:09,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 18:22:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:09,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:09,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:09,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396739866] [2024-11-11 18:22:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396739866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230907832] [2024-11-11 18:22:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:09,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:09,629 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:09,667 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-11 18:22:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:09,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-11 18:22:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:09,670 INFO L225 Difference]: With dead ends: 74 [2024-11-11 18:22:09,670 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 18:22:09,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:09,676 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:09,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 18:22:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-11 18:22:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-11 18:22:09,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2024-11-11 18:22:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:09,688 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-11 18:22:09,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-11 18:22:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 18:22:09,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:09,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:09,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:09,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 810873816, now seen corresponding path program 1 times [2024-11-11 18:22:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371874049] [2024-11-11 18:22:09,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:09,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:09,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 18:22:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:09,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:09,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:10,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:10,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371874049] [2024-11-11 18:22:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371874049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444216248] [2024-11-11 18:22:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:10,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,015 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:10,069 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-11 18:22:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-11 18:22:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:10,072 INFO L225 Difference]: With dead ends: 77 [2024-11-11 18:22:10,072 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 18:22:10,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,073 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:10,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 18:22:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-11 18:22:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-11 18:22:10,084 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 34 [2024-11-11 18:22:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-11 18:22:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-11 18:22:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 18:22:10,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,091 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 (5)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:10,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2026721905, now seen corresponding path program 1 times [2024-11-11 18:22:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431240185] [2024-11-11 18:22:10,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:10,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:10,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-11 18:22:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:10,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:10,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:10,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431240185] [2024-11-11 18:22:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431240185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676943998] [2024-11-11 18:22:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,410 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:10,435 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-11 18:22:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-11 18:22:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:10,437 INFO L225 Difference]: With dead ends: 77 [2024-11-11 18:22:10,437 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 18:22:10,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,439 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:10,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 18:22:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-11 18:22:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-11 18:22:10,450 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 35 [2024-11-11 18:22:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:10,450 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-11 18:22:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-11 18:22:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 18:22:10,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-11 18:22:10,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:10,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -110305028, now seen corresponding path program 1 times [2024-11-11 18:22:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:10,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653053390] [2024-11-11 18:22:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:10,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:10,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-11 18:22:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:10,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:10,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:10,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653053390] [2024-11-11 18:22:10,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653053390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:10,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:10,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135763588] [2024-11-11 18:22:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,764 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:10,787 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-11 18:22:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:10,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-11 18:22:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:10,789 INFO L225 Difference]: With dead ends: 77 [2024-11-11 18:22:10,789 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 18:22:10,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:10,790 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:10,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 18:22:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-11 18:22:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 18:22:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-11 18:22:10,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2024-11-11 18:22:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-11 18:22:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 18:22:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-11 18:22:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 18:22:10,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:11,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:11,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:11,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -403708035, now seen corresponding path program 1 times [2024-11-11 18:22:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:11,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109846107] [2024-11-11 18:22:11,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:11,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:11,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-11 18:22:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 18:22:11,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 18:22:11,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:12,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109846107] [2024-11-11 18:22:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109846107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:12,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-11 18:22:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501180930] [2024-11-11 18:22:12,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 18:22:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 18:22:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-11 18:22:12,610 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:13,098 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2024-11-11 18:22:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 18:22:13,099 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-11-11 18:22:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:13,103 INFO L225 Difference]: With dead ends: 96 [2024-11-11 18:22:13,103 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 18:22:13,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-11 18:22:13,104 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:13,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 542 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 18:22:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 18:22:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-11-11 18:22:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-11 18:22:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2024-11-11 18:22:13,126 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 36 [2024-11-11 18:22:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2024-11-11 18:22:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-11 18:22:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 18:22:13,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:13,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:13,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:13,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1637683364, now seen corresponding path program 1 times [2024-11-11 18:22:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117336262] [2024-11-11 18:22:13,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:13,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:13,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:13,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-11 18:22:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:13,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 18:22:13,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 18:22:13,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:13,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117336262] [2024-11-11 18:22:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117336262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:13,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 18:22:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668371355] [2024-11-11 18:22:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:13,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 18:22:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 18:22:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 18:22:13,587 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 18:22:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:13,796 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2024-11-11 18:22:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 18:22:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-11 18:22:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:13,798 INFO L225 Difference]: With dead ends: 119 [2024-11-11 18:22:13,798 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 18:22:13,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 18:22:13,799 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:13,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 482 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 18:22:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2024-11-11 18:22:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-11 18:22:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2024-11-11 18:22:13,807 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 38 [2024-11-11 18:22:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:13,808 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2024-11-11 18:22:13,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 18:22:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2024-11-11 18:22:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 18:22:13,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:13,809 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:13,820 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 (9)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:14,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:14,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash -987503231, now seen corresponding path program 1 times [2024-11-11 18:22:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753496016] [2024-11-11 18:22:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:14,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-11 18:22:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:14,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 18:22:14,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 18:22:14,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 18:22:14,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753496016] [2024-11-11 18:22:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753496016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:14,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-11 18:22:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956666147] [2024-11-11 18:22:14,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-11 18:22:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-11 18:22:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-11 18:22:14,548 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-11 18:22:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:15,015 INFO L93 Difference]: Finished difference Result 108 states and 152 transitions. [2024-11-11 18:22:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 18:22:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2024-11-11 18:22:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:15,018 INFO L225 Difference]: With dead ends: 108 [2024-11-11 18:22:15,018 INFO L226 Difference]: Without dead ends: 106 [2024-11-11 18:22:15,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-11 18:22:15,019 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:15,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 18:22:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-11 18:22:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2024-11-11 18:22:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-11 18:22:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-11 18:22:15,030 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 41 [2024-11-11 18:22:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-11 18:22:15,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-11 18:22:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-11 18:22:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 18:22:15,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:15,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:15,040 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 (10)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:15,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1947898161, now seen corresponding path program 1 times [2024-11-11 18:22:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737664016] [2024-11-11 18:22:15,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:15,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:15,238 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:15,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-11 18:22:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:15,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 18:22:15,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 18:22:15,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:15,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737664016] [2024-11-11 18:22:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737664016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 18:22:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549026410] [2024-11-11 18:22:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 18:22:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 18:22:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 18:22:15,316 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 18:22:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:15,341 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2024-11-11 18:22:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 18:22:15,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-11 18:22:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:15,343 INFO L225 Difference]: With dead ends: 83 [2024-11-11 18:22:15,343 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 18:22:15,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 18:22:15,345 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:15,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 18:22:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-11 18:22:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-11 18:22:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-11 18:22:15,355 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 43 [2024-11-11 18:22:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:15,360 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-11 18:22:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 18:22:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-11 18:22:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 18:22:15,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:15,361 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:15,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1178252102, now seen corresponding path program 1 times [2024-11-11 18:22:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883930251] [2024-11-11 18:22:15,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:15,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:15,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-11 18:22:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:15,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 18:22:15,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:15,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883930251] [2024-11-11 18:22:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883930251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331560667] [2024-11-11 18:22:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:15,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:15,675 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:15,706 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-11 18:22:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-11-11 18:22:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:15,710 INFO L225 Difference]: With dead ends: 109 [2024-11-11 18:22:15,710 INFO L226 Difference]: Without dead ends: 84 [2024-11-11 18:22:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:15,711 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:15,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-11 18:22:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-11 18:22:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2024-11-11 18:22:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-11 18:22:15,737 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 46 [2024-11-11 18:22:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:15,738 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-11 18:22:15,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-11 18:22:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 18:22:15,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:15,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:15,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-11 18:22:15,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:15,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -101611576, now seen corresponding path program 1 times [2024-11-11 18:22:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748938384] [2024-11-11 18:22:15,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:15,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:15,944 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 (13)] Waiting until timeout for monitored process [2024-11-11 18:22:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:16,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 18:22:16,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 18:22:16,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 18:22:17,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748938384] [2024-11-11 18:22:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748938384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:17,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:17,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-11 18:22:17,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446795745] [2024-11-11 18:22:17,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:17,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 18:22:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 18:22:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-11 18:22:17,464 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-11 18:22:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:18,604 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2024-11-11 18:22:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 18:22:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2024-11-11 18:22:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:18,606 INFO L225 Difference]: With dead ends: 147 [2024-11-11 18:22:18,606 INFO L226 Difference]: Without dead ends: 110 [2024-11-11 18:22:18,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-11-11 18:22:18,608 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:18,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 752 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 18:22:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-11 18:22:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2024-11-11 18:22:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (26), 22 states have call predecessors, (26), 18 states have call successors, (26) [2024-11-11 18:22:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-11 18:22:18,623 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 46 [2024-11-11 18:22:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-11 18:22:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-11 18:22:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-11 18:22:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 18:22:18,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,630 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,638 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 (13)] Ended with exit code 0 [2024-11-11 18:22:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:18,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1695459100, now seen corresponding path program 1 times [2024-11-11 18:22:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856590286] [2024-11-11 18:22:18,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:18,835 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:18,837 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 (14)] Waiting until timeout for monitored process [2024-11-11 18:22:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:18,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:18,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 18:22:18,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:18,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856590286] [2024-11-11 18:22:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856590286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502164823] [2024-11-11 18:22:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:18,940 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:18,974 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2024-11-11 18:22:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-11 18:22:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:18,977 INFO L225 Difference]: With dead ends: 113 [2024-11-11 18:22:18,978 INFO L226 Difference]: Without dead ends: 88 [2024-11-11 18:22:18,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:18,980 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:18,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-11 18:22:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-11 18:22:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 61 states have internal predecessors, (77), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 23 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-11 18:22:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-11-11 18:22:18,993 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 48 [2024-11-11 18:22:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:18,994 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-11-11 18:22:18,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-11-11 18:22:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 18:22:18,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,998 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:19,003 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 (14)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:19,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1319644518, now seen corresponding path program 1 times [2024-11-11 18:22:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836236901] [2024-11-11 18:22:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:19,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:19,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:19,204 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:19,206 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 (15)] Waiting until timeout for monitored process [2024-11-11 18:22:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:19,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 18:22:19,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-11 18:22:19,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:20,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836236901] [2024-11-11 18:22:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836236901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 18:22:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [508286057] [2024-11-11 18:22:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-11 18:22:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-11 18:22:20,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-11 18:22:20,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-11 18:22:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:21,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 18:22:21,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-11 18:22:21,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [508286057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 18:22:21,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-11-11 18:22:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324316926] [2024-11-11 18:22:21,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:21,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 18:22:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 18:22:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-11 18:22:21,532 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-11 18:22:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:22,074 INFO L93 Difference]: Finished difference Result 139 states and 200 transitions. [2024-11-11 18:22:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 18:22:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-11 18:22:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:22,076 INFO L225 Difference]: With dead ends: 139 [2024-11-11 18:22:22,077 INFO L226 Difference]: Without dead ends: 137 [2024-11-11 18:22:22,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-11 18:22:22,078 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:22,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 482 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 18:22:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-11 18:22:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2024-11-11 18:22:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.25) internal successors, (80), 62 states have internal predecessors, (80), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (35), 25 states have call predecessors, (35), 19 states have call successors, (35) [2024-11-11 18:22:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-11 18:22:22,089 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 48 [2024-11-11 18:22:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:22,089 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-11 18:22:22,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-11 18:22:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-11 18:22:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 18:22:22,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:22,091 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:22,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:22,295 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 (15)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:22,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:22,492 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:22,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -458335062, now seen corresponding path program 1 times [2024-11-11 18:22:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941609883] [2024-11-11 18:22:22,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:22,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:22,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:22,497 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 (17)] Waiting until timeout for monitored process [2024-11-11 18:22:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:22,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 18:22:22,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 18:22:22,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 18:22:23,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941609883] [2024-11-11 18:22:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941609883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:23,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-11 18:22:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28321527] [2024-11-11 18:22:23,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 18:22:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 18:22:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-11 18:22:23,008 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 18:22:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:23,271 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2024-11-11 18:22:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:23,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2024-11-11 18:22:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:23,274 INFO L225 Difference]: With dead ends: 110 [2024-11-11 18:22:23,274 INFO L226 Difference]: Without dead ends: 89 [2024-11-11 18:22:23,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-11 18:22:23,275 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:23,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 468 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-11 18:22:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-11 18:22:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 22 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-11 18:22:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-11 18:22:23,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 48 [2024-11-11 18:22:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:23,291 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-11 18:22:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 18:22:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-11 18:22:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 18:22:23,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:23,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:23,298 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 (17)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:23,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1205492313, now seen corresponding path program 1 times [2024-11-11 18:22:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989659499] [2024-11-11 18:22:23,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:23,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:23,496 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:23,497 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 (18)] Waiting until timeout for monitored process [2024-11-11 18:22:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:23,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 18:22:23,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 18:22:23,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 18:22:24,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989659499] [2024-11-11 18:22:24,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989659499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:24,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:24,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-11-11 18:22:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351793573] [2024-11-11 18:22:24,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:24,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 18:22:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 18:22:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-11 18:22:24,059 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 18:22:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:24,316 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2024-11-11 18:22:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2024-11-11 18:22:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:24,317 INFO L225 Difference]: With dead ends: 117 [2024-11-11 18:22:24,317 INFO L226 Difference]: Without dead ends: 75 [2024-11-11 18:22:24,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-11 18:22:24,319 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:24,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 507 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-11 18:22:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-11 18:22:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (23), 16 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-11 18:22:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-11-11 18:22:24,326 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 48 [2024-11-11 18:22:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:24,327 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-11-11 18:22:24,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 18:22:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-11-11 18:22:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 18:22:24,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:24,329 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:24,337 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 (18)] Ended with exit code 0 [2024-11-11 18:22:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:24,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1014505839, now seen corresponding path program 1 times [2024-11-11 18:22:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518880647] [2024-11-11 18:22:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:24,534 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:24,536 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 (19)] Waiting until timeout for monitored process [2024-11-11 18:22:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:24,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 18:22:24,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 18:22:24,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 18:22:25,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:25,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518880647] [2024-11-11 18:22:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518880647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:25,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-11 18:22:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992937498] [2024-11-11 18:22:25,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 18:22:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 18:22:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:25,021 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 18:22:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:25,262 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2024-11-11 18:22:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:25,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2024-11-11 18:22:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:25,264 INFO L225 Difference]: With dead ends: 86 [2024-11-11 18:22:25,264 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 18:22:25,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-11 18:22:25,265 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:25,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 415 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 18:22:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-11 18:22:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-11 18:22:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-11 18:22:25,272 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 48 [2024-11-11 18:22:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-11 18:22:25,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 18:22:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-11 18:22:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 18:22:25,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:25,273 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:25,280 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 (19)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:25,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:25,478 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1319000567, now seen corresponding path program 1 times [2024-11-11 18:22:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470570316] [2024-11-11 18:22:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:25,480 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:25,482 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 (20)] Waiting until timeout for monitored process [2024-11-11 18:22:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:25,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 18:22:25,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:25,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:25,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470570316] [2024-11-11 18:22:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470570316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:25,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658669859] [2024-11-11 18:22:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:25,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:25,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:25,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:25,566 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:25,600 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2024-11-11 18:22:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-11 18:22:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:25,602 INFO L225 Difference]: With dead ends: 98 [2024-11-11 18:22:25,602 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 18:22:25,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:25,603 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 18:22:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-11 18:22:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-11 18:22:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-11 18:22:25,611 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2024-11-11 18:22:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:25,611 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-11 18:22:25,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-11 18:22:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 18:22:25,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:25,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:25,618 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 (20)] Ended with exit code 0 [2024-11-11 18:22:25,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:25,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 584647616, now seen corresponding path program 1 times [2024-11-11 18:22:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820303434] [2024-11-11 18:22:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:25,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:25,815 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:25,816 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 (21)] Waiting until timeout for monitored process [2024-11-11 18:22:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:25,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:25,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 18:22:25,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:25,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820303434] [2024-11-11 18:22:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820303434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301690235] [2024-11-11 18:22:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:25,901 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:25,974 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2024-11-11 18:22:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-11-11 18:22:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:25,977 INFO L225 Difference]: With dead ends: 96 [2024-11-11 18:22:25,977 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 18:22:25,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:25,978 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:25,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 18:22:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-11 18:22:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-11 18:22:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-11 18:22:25,984 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 50 [2024-11-11 18:22:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:25,985 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-11 18:22:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 18:22:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-11 18:22:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 18:22:25,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:25,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:25,992 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 (21)] Ended with exit code 0 [2024-11-11 18:22:26,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:26,187 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:26,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash -412424737, now seen corresponding path program 1 times [2024-11-11 18:22:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978355807] [2024-11-11 18:22:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:26,191 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:26,192 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 (22)] Waiting until timeout for monitored process [2024-11-11 18:22:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:26,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 18:22:26,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 18:22:26,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 18:22:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 18:22:26,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:26,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978355807] [2024-11-11 18:22:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978355807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 18:22:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298092469] [2024-11-11 18:22:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 18:22:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 18:22:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-11 18:22:26,776 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 18:22:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:27,530 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2024-11-11 18:22:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 18:22:27,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-11 18:22:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:27,532 INFO L225 Difference]: With dead ends: 70 [2024-11-11 18:22:27,532 INFO L226 Difference]: Without dead ends: 49 [2024-11-11 18:22:27,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-11 18:22:27,533 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:27,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 18:22:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-11 18:22:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-11 18:22:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-11 18:22:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-11 18:22:27,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 50 [2024-11-11 18:22:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:27,538 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-11 18:22:27,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 18:22:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-11 18:22:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 18:22:27,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:27,540 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:27,549 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 (22)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:27,740 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1377347757, now seen corresponding path program 1 times [2024-11-11 18:22:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15705530] [2024-11-11 18:22:27,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:27,743 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:27,744 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 (23)] Waiting until timeout for monitored process [2024-11-11 18:22:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:27,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 18:22:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 18:22:28,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 18:22:29,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15705530] [2024-11-11 18:22:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15705530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:29,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-11 18:22:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402502325] [2024-11-11 18:22:29,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:29,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 18:22:29,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 18:22:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-11 18:22:29,177 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 18:22:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:29,788 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-11-11 18:22:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 18:22:29,789 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2024-11-11 18:22:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:29,790 INFO L225 Difference]: With dead ends: 78 [2024-11-11 18:22:29,790 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 18:22:29,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2024-11-11 18:22:29,790 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:29,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 252 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 18:22:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 18:22:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-11 18:22:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-11 18:22:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-11 18:22:29,795 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2024-11-11 18:22:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:29,795 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-11 18:22:29,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 18:22:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-11 18:22:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 18:22:29,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:29,796 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:29,803 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 (23)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:29,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:29,997 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1696305608, now seen corresponding path program 1 times [2024-11-11 18:22:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838812622] [2024-11-11 18:22:29,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:30,001 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:30,002 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 (24)] Waiting until timeout for monitored process [2024-11-11 18:22:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:30,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 18:22:30,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:30,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 18:22:30,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 18:22:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 18:22:30,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:30,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838812622] [2024-11-11 18:22:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838812622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:30,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 18:22:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322235223] [2024-11-11 18:22:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:30,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 18:22:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 18:22:30,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 18:22:30,247 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:30,531 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-11 18:22:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:30,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-11-11 18:22:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:30,534 INFO L225 Difference]: With dead ends: 66 [2024-11-11 18:22:30,534 INFO L226 Difference]: Without dead ends: 49 [2024-11-11 18:22:30,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:30,535 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:30,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-11 18:22:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-11 18:22:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-11 18:22:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-11 18:22:30,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 60 [2024-11-11 18:22:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-11 18:22:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-11 18:22:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 18:22:30,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:30,541 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:30,546 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 (24)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:30,741 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1055709639, now seen corresponding path program 1 times [2024-11-11 18:22:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125571781] [2024-11-11 18:22:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:30,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:30,744 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:30,744 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 (25)] Waiting until timeout for monitored process [2024-11-11 18:22:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:30,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 18:22:30,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 18:22:31,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:31,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125571781] [2024-11-11 18:22:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125571781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:31,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 18:22:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104053850] [2024-11-11 18:22:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 18:22:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 18:22:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 18:22:31,064 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:31,427 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-11 18:22:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-11-11 18:22:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:31,428 INFO L225 Difference]: With dead ends: 68 [2024-11-11 18:22:31,428 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 18:22:31,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:31,429 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:31,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 18:22:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 18:22:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-11 18:22:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-11 18:22:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-11 18:22:31,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 61 [2024-11-11 18:22:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-11 18:22:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-11 18:22:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 18:22:31,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:31,436 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:31,441 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 (25)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:31,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:31,637 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:31,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash -187739156, now seen corresponding path program 1 times [2024-11-11 18:22:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739045268] [2024-11-11 18:22:31,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:31,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:31,640 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:31,641 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 (26)] Waiting until timeout for monitored process [2024-11-11 18:22:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:31,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 18:22:31,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 18:22:31,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:31,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:31,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739045268] [2024-11-11 18:22:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739045268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 18:22:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967096479] [2024-11-11 18:22:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:31,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 18:22:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 18:22:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 18:22:31,916 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:32,186 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-11 18:22:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-11 18:22:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:32,187 INFO L225 Difference]: With dead ends: 68 [2024-11-11 18:22:32,187 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 18:22:32,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:32,188 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:32,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 18:22:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-11 18:22:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-11 18:22:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-11 18:22:32,193 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2024-11-11 18:22:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-11 18:22:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-11 18:22:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 18:22:32,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:32,195 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:32,201 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 (26)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:32,395 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:32,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1230639261, now seen corresponding path program 1 times [2024-11-11 18:22:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179947070] [2024-11-11 18:22:32,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:32,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:32,398 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:32,399 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 (27)] Waiting until timeout for monitored process [2024-11-11 18:22:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:32,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 18:22:32,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 18:22:32,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:32,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179947070] [2024-11-11 18:22:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179947070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:32,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 18:22:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048123712] [2024-11-11 18:22:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:32,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 18:22:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 18:22:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 18:22:32,615 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:32,970 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-11 18:22:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:32,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-11-11 18:22:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:32,971 INFO L225 Difference]: With dead ends: 65 [2024-11-11 18:22:32,972 INFO L226 Difference]: Without dead ends: 48 [2024-11-11 18:22:32,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 18:22:32,972 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:32,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 262 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 18:22:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-11 18:22:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-11 18:22:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 18:22:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-11 18:22:32,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 63 [2024-11-11 18:22:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:32,977 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-11 18:22:32,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 18:22:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-11 18:22:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 18:22:32,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:32,978 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:32,986 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 (27)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:33,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:33,182 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:33,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:33,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1065424800, now seen corresponding path program 1 times [2024-11-11 18:22:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:33,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096948549] [2024-11-11 18:22:33,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:33,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:33,186 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:33,187 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 (28)] Waiting until timeout for monitored process [2024-11-11 18:22:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:33,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 18:22:33,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:33,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 18:22:33,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 18:22:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 18:22:33,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 18:22:33,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096948549] [2024-11-11 18:22:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096948549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:33,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:33,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-11 18:22:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844515380] [2024-11-11 18:22:33,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:33,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 18:22:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 18:22:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-11 18:22:33,714 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-11 18:22:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:33,961 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-11 18:22:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 18:22:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2024-11-11 18:22:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:33,963 INFO L225 Difference]: With dead ends: 64 [2024-11-11 18:22:33,963 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 18:22:33,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-11 18:22:33,964 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:33,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 347 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:22:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 18:22:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-11 18:22:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-11 18:22:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-11 18:22:33,968 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2024-11-11 18:22:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-11 18:22:33,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-11 18:22:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-11 18:22:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 18:22:33,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:33,969 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:33,977 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 (28)] Ended with exit code 0 [2024-11-11 18:22:34,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:34,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:34,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -846570082, now seen corresponding path program 1 times [2024-11-11 18:22:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600929371] [2024-11-11 18:22:34,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:34,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:34,173 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:34,174 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 (29)] Waiting until timeout for monitored process [2024-11-11 18:22:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:34,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:34,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 18:22:34,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:34,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:34,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600929371] [2024-11-11 18:22:34,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600929371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:34,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486463956] [2024-11-11 18:22:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:34,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:34,270 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 18:22:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:34,326 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-11-11 18:22:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-11 18:22:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:34,328 INFO L225 Difference]: With dead ends: 66 [2024-11-11 18:22:34,328 INFO L226 Difference]: Without dead ends: 45 [2024-11-11 18:22:34,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:34,328 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:34,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-11 18:22:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-11 18:22:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 18:22:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-11 18:22:34,334 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2024-11-11 18:22:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-11 18:22:34,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 18:22:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-11 18:22:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 18:22:34,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:34,335 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:34,341 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 (29)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:34,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:34,536 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2063488209, now seen corresponding path program 1 times [2024-11-11 18:22:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704523914] [2024-11-11 18:22:34,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:34,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:34,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:34,539 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:22:34,540 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 (30)] Waiting until timeout for monitored process [2024-11-11 18:22:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:34,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 18:22:34,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 18:22:34,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 18:22:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 18:22:34,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704523914] [2024-11-11 18:22:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704523914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 18:22:34,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 18:22:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-11 18:22:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562372612] [2024-11-11 18:22:34,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 18:22:34,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 18:22:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:34,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 18:22:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-11 18:22:34,943 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 18:22:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:35,053 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-11 18:22:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 18:22:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2024-11-11 18:22:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:35,054 INFO L225 Difference]: With dead ends: 46 [2024-11-11 18:22:35,055 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 18:22:35,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-11 18:22:35,055 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:35,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:22:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 18:22:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 18:22:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:22:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 18:22:35,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-11-11 18:22:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 18:22:35,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 18:22:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 18:22:35,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 18:22:35,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-11 18:22:35,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-11 18:22:35,064 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 (30)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:35,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:22:35,263 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:35,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 18:22:36,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:36,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-11 18:22:36,185 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-11 18:22:36,217 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 18:22:36,218 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 18:22:36,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-11 18:22:36,223 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark. at java.base/java.math.BigDecimal.(BigDecimal.java:518) at java.base/java.math.BigDecimal.(BigDecimal.java:401) at java.base/java.math.BigDecimal.(BigDecimal.java:834) at java.base/java.math.BigDecimal.valueOf(BigDecimal.java:1304) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.getDecimalFromBinaryString(Boogie2ACSL.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.constructFloat(Boogie2ACSL.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateFunctionApplication(Boogie2ACSL.java:321) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:587) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:587) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateEnsuresExpression(Boogie2ACSL.java:117) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateProcedureContract(CACSL2BoogieBacktranslator.java:809) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateProcedureContract(CACSL2BoogieBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-11 18:22:36,227 INFO L158 Benchmark]: Toolchain (without parser) took 28983.40ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.8MB in the beginning and 38.0MB in the end (delta: 7.8MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,227 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:36,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.91ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 31.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.97ms. Allocated memory is still 65.0MB. Free memory was 31.6MB in the beginning and 29.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,228 INFO L158 Benchmark]: Boogie Preprocessor took 82.97ms. Allocated memory is still 65.0MB. Free memory was 29.8MB in the beginning and 45.1MB in the end (delta: -15.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,228 INFO L158 Benchmark]: RCFGBuilder took 537.22ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 29.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,228 INFO L158 Benchmark]: TraceAbstraction took 27921.04ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 28.6MB in the beginning and 38.0MB in the end (delta: -9.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-11 18:22:36,229 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 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.91ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 31.6MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.97ms. Allocated memory is still 65.0MB. Free memory was 31.6MB in the beginning and 29.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.97ms. Allocated memory is still 65.0MB. Free memory was 29.8MB in the beginning and 45.1MB in the end (delta: -15.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 537.22ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 29.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27921.04ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 28.6MB in the beginning and 38.0MB in the end (delta: -9.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * 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: 77]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 83]: 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 3 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 8394 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6832 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3762 IncrementalHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 1562 mSDtfsCounter, 3762 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1646 SyntacticMatches, 4 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=14, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 161 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1782 ConstructedInterpolants, 12 QuantifiedInterpolants, 6008 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3124 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 948/1076 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 2 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 59]: Procedure Contract for isnan_float Derived contract for procedure isnan_float. Ensures: ((0 == \result) || (1 == \result)) - ExceptionOrErrorResult: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark.: java.base/java.math.BigDecimal.(BigDecimal.java:518) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-11 18:22:36,281 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: ERROR: ExceptionOrErrorResult: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark.