./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:43:02,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:43:02,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:43:02,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:43:02,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:43:02,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:43:02,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:43:02,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:43:02,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:43:02,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:43:02,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:43:02,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:43:02,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:43:02,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:43:02,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:43:02,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:43:02,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:43:02,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:43:02,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:43:02,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:43:02,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:43:02,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:43:02,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:43:02,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:43:02,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:43:02,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:43:02,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:43:02,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:43:02,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:43:02,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:43:02,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:43:02,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:43:02,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:43:02,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:43:02,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:43:02,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:43:02,930 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2024-11-08 12:43:03,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:43:03,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:43:03,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:43:03,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:43:03,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:43:03,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-08 12:43:04,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:43:04,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:43:04,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-08 12:43:04,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfd3d065/6a0e7e0e6f014e238b5698a431504eda/FLAG6f56a562c [2024-11-08 12:43:05,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfd3d065/6a0e7e0e6f014e238b5698a431504eda [2024-11-08 12:43:05,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:43:05,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:43:05,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:43:05,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:43:05,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:43:05,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3682d3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05, skipping insertion in model container [2024-11-08 12:43:05,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:43:05,512 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_1251.c[1980,1993] [2024-11-08 12:43:05,518 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_1251.c[2139,2152] [2024-11-08 12:43:05,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:43:05,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:43:05,549 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_1251.c[1980,1993] [2024-11-08 12:43:05,549 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_1251.c[2139,2152] [2024-11-08 12:43:05,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:43:05,562 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:43:05,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05 WrapperNode [2024-11-08 12:43:05,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:43:05,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:43:05,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:43:05,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:43:05,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,590 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-08 12:43:05,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:43:05,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:43:05,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:43:05,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:43:05,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,615 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-08 12:43:05,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:43:05,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:43:05,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:43:05,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:43:05,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (1/1) ... [2024-11-08 12:43:05,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:43:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:43:05,667 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-08 12:43:05,674 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-08 12:43:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:43:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:43:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:43:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:43:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-08 12:43:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-08 12:43:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:43:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:43:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:43:05,794 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:43:05,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:43:06,082 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 12:43:06,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:43:06,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:43:06,102 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 12:43:06,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:06 BoogieIcfgContainer [2024-11-08 12:43:06,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:43:06,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:43:06,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:43:06,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:43:06,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:43:05" (1/3) ... [2024-11-08 12:43:06,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f766635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:43:06, skipping insertion in model container [2024-11-08 12:43:06,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:05" (2/3) ... [2024-11-08 12:43:06,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f766635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:43:06, skipping insertion in model container [2024-11-08 12:43:06,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:06" (3/3) ... [2024-11-08 12:43:06,112 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-11-08 12:43:06,124 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:43:06,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 12:43:06,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:43:06,173 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;@10de5bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:43:06,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 12:43:06,176 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-08 12:43:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 12:43:06,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:06,182 INFO L215 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-08 12:43:06,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:06,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash 601066810, now seen corresponding path program 1 times [2024-11-08 12:43:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466120826] [2024-11-08 12:43:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:43:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:43:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,501 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-08 12:43:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466120826] [2024-11-08 12:43:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466120826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:43:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18700870] [2024-11-08 12:43:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:06,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:43:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:43:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:43:06,546 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-08 12:43:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:06,658 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2024-11-08 12:43:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:43:06,663 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-08 12:43:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:06,672 INFO L225 Difference]: With dead ends: 97 [2024-11-08 12:43:06,673 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 12:43:06,675 INFO L431 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-08 12:43:06,677 INFO L432 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-08 12:43:06,678 INFO L433 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-08 12:43:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 12:43:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-08 12:43:06,706 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-08 12:43:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-08 12:43:06,708 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 28 [2024-11-08 12:43:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:06,709 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-08 12:43:06,709 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-08 12:43:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-08 12:43:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 12:43:06,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:06,713 INFO L215 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-08 12:43:06,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:43:06,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:06,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash 246404667, now seen corresponding path program 1 times [2024-11-08 12:43:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309725610] [2024-11-08 12:43:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 12:43:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 12:43:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 12:43:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:06,938 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-08 12:43:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309725610] [2024-11-08 12:43:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309725610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:06,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:43:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199747919] [2024-11-08 12:43:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:06,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:43:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:43:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:43:06,942 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-08 12:43:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:07,028 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2024-11-08 12:43:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:43:07,032 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-08 12:43:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:07,038 INFO L225 Difference]: With dead ends: 77 [2024-11-08 12:43:07,038 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 12:43:07,039 INFO L431 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-08 12:43:07,040 INFO L432 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-08 12:43:07,040 INFO L433 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-08 12:43:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 12:43:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 12:43:07,050 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-08 12:43:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-08 12:43:07,051 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 34 [2024-11-08 12:43:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-08 12:43:07,052 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-08 12:43:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-08 12:43:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 12:43:07,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:07,056 INFO L215 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-08 12:43:07,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:43:07,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1526150318, now seen corresponding path program 1 times [2024-11-08 12:43:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765342252] [2024-11-08 12:43:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 12:43:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 12:43:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 12:43:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,181 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-08 12:43:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765342252] [2024-11-08 12:43:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765342252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:43:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637026872] [2024-11-08 12:43:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:07,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:43:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:43:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:43:07,184 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-08 12:43:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:07,251 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-08 12:43:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:43:07,252 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-08 12:43:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:07,253 INFO L225 Difference]: With dead ends: 81 [2024-11-08 12:43:07,253 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 12:43:07,253 INFO L431 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-08 12:43:07,254 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-08 12:43:07,254 INFO L433 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-08 12:43:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 12:43:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-08 12:43:07,264 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-08 12:43:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-08 12:43:07,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 35 [2024-11-08 12:43:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:07,266 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-08 12:43:07,267 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-08 12:43:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-08 12:43:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 12:43:07,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:07,268 INFO L215 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-08 12:43:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:43:07,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1631952791, now seen corresponding path program 1 times [2024-11-08 12:43:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9668516] [2024-11-08 12:43:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 12:43:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 12:43:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 12:43:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,404 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-08 12:43:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9668516] [2024-11-08 12:43:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9668516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:43:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442309388] [2024-11-08 12:43:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:43:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:43:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:43:07,411 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-08 12:43:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:07,469 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-08 12:43:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:43:07,469 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-08 12:43:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:07,470 INFO L225 Difference]: With dead ends: 81 [2024-11-08 12:43:07,470 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 12:43:07,471 INFO L431 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-08 12:43:07,471 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:07,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:43:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 12:43:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-08 12:43:07,476 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-08 12:43:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-08 12:43:07,476 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 36 [2024-11-08 12:43:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-08 12:43:07,477 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-08 12:43:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-08 12:43:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 12:43:07,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:07,478 INFO L215 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-08 12:43:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:43:07,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1273333138, now seen corresponding path program 1 times [2024-11-08 12:43:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530531342] [2024-11-08 12:43:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:07,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 12:43:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 12:43:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:43:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,542 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-08 12:43:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530531342] [2024-11-08 12:43:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530531342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:07,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:43:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562521737] [2024-11-08 12:43:07,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:43:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:07,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:43:07,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:43:07,543 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-08 12:43:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:07,594 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-08 12:43:07,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:43:07,595 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-08 12:43:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:07,596 INFO L225 Difference]: With dead ends: 81 [2024-11-08 12:43:07,596 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 12:43:07,596 INFO L431 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-08 12:43:07,597 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:07,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:43:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 12:43:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-08 12:43:07,601 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-08 12:43:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-08 12:43:07,602 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 37 [2024-11-08 12:43:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-08 12:43:07,603 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-08 12:43:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-08 12:43:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 12:43:07,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:07,604 INFO L215 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-08 12:43:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:43:07,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1778891763, now seen corresponding path program 1 times [2024-11-08 12:43:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:07,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345999692] [2024-11-08 12:43:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:43:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 12:43:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 12:43:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:43:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:07,711 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-08 12:43:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:43:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345999692] [2024-11-08 12:43:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345999692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945752178] [2024-11-08 12:43:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:43:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:07,716 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-08 12:43:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:07,765 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-11-08 12:43:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:07,766 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-08 12:43:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:07,767 INFO L225 Difference]: With dead ends: 60 [2024-11-08 12:43:07,768 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 12:43:07,768 INFO L431 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-08 12:43:07,769 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:07,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:43:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 12:43:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 12:43:07,777 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-08 12:43:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-08 12:43:07,778 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 37 [2024-11-08 12:43:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-08 12:43:07,780 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-08 12:43:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-08 12:43:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 12:43:07,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:07,781 INFO L215 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-08 12:43:07,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:43:07,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:07,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1941560781, now seen corresponding path program 1 times [2024-11-08 12:43:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:43:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133589070] [2024-11-08 12:43:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:43:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:43:07,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:43:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:43:07,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:43:07,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:43:07,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 12:43:07,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 12:43:07,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:43:07,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:43:07,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:43:07,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:43:07 BoogieIcfgContainer [2024-11-08 12:43:07,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:43:07,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:43:07,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:43:07,874 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:43:07,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:06" (3/4) ... [2024-11-08 12:43:07,877 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:43:07,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:43:07,878 INFO L158 Benchmark]: Toolchain (without parser) took 2652.13ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 117.8MB in the beginning and 199.3MB in the end (delta: -81.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:43:07,879 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 42.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:43:07,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.55ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 145.4MB in the end (delta: -27.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 12:43:07,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.67ms. Allocated memory is still 184.5MB. Free memory was 145.4MB in the beginning and 143.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:43:07,879 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 184.5MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:43:07,881 INFO L158 Benchmark]: RCFGBuilder took 475.53ms. Allocated memory is still 184.5MB. Free memory was 141.2MB in the beginning and 125.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 12:43:07,881 INFO L158 Benchmark]: TraceAbstraction took 1769.33ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 124.4MB in the beginning and 199.3MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:43:07,881 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 253.8MB. Free memory is still 199.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:43:07,882 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.19ms. Allocated memory is still 96.5MB. Free memory is still 42.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.55ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 145.4MB in the end (delta: -27.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.67ms. Allocated memory is still 184.5MB. Free memory was 145.4MB in the beginning and 143.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 184.5MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.53ms. Allocated memory is still 184.5MB. Free memory was 141.2MB in the beginning and 125.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1769.33ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 124.4MB in the beginning and 199.3MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 253.8MB. Free memory is still 199.3MB. 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: 76]: 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 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L57] return x != x; VAL [\old(x)=4286578699, \result=1] [L69] RET, EXPR isnan_float(x) VAL [x=4286578699] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L57] return x != x; VAL [\old(x)=4286578698, \result=0] [L69] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=4286578699, y=4286578698] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578699] [L23] __uint32_t w; VAL [\old(x)=4286578699, x=4286578699] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578699, \result=0, x=4286578699] [L46] RET, EXPR __fpclassify_float(x) VAL [x=4286578699, y=4286578698] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\result=4286578698, x=4286578699] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L57] return x != x; VAL [\old(x)=4286578699, \result=1] [L75] RET, EXPR isnan_float(x) VAL [x=4286578699, y=4286578698] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L57] return x != x; VAL [\old(x)=4286578698, \result=0] [L75] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [x=4286578699, y=4286578698] - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 0.3s 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.1s 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, 0.8s 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-08 12:43:07,904 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 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_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:43:09,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:43:09,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:43:09,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:43:09,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:43:09,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:43:09,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:43:09,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:43:09,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:43:09,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:43:09,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:43:09,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:43:09,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:43:09,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:43:09,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:43:09,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:43:09,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:43:09,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:43:09,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:43:09,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:43:09,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:43:09,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:43:09,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:43:09,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:43:09,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:43:09,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:43:09,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:43:09,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:43:09,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:43:09,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:43:09,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:43:09,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:43:09,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:43:09,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:43:09,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:43:09,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:43:09,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:43:09,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:43:09,968 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:43:09,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:43:09,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:43:09,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:43:09,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:43:09,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:43:09,969 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2024-11-08 12:43:10,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:43:10,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:43:10,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:43:10,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:43:10,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:43:10,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-08 12:43:11,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:43:11,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:43:11,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-08 12:43:11,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec41f8059/b5b5b7748ed84e0fb80a9e6a0c77a038/FLAGe3b3d4cb4 [2024-11-08 12:43:11,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec41f8059/b5b5b7748ed84e0fb80a9e6a0c77a038 [2024-11-08 12:43:11,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:43:11,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:43:11,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:43:11,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:43:11,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:43:11,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:11" (1/1) ... [2024-11-08 12:43:11,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32705182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:11, skipping insertion in model container [2024-11-08 12:43:11,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:43:11" (1/1) ... [2024-11-08 12:43:11,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:43:12,074 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_1251.c[1980,1993] [2024-11-08 12:43:12,095 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_1251.c[2139,2152] [2024-11-08 12:43:12,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:43:12,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:43:12,132 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_1251.c[1980,1993] [2024-11-08 12:43:12,133 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_1251.c[2139,2152] [2024-11-08 12:43:12,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:43:12,148 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:43:12,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12 WrapperNode [2024-11-08 12:43:12,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:43:12,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:43:12,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:43:12,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:43:12,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,180 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-11-08 12:43:12,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:43:12,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:43:12,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:43:12,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:43:12,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,208 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-08 12:43:12,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:43:12,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:43:12,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:43:12,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:43:12,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (1/1) ... [2024-11-08 12:43:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:43:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:43:12,265 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-08 12:43:12,266 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-08 12:43:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:43:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:43:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 12:43:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:43:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-08 12:43:12,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-08 12:43:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-08 12:43:12,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:43:12,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 12:43:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:43:12,387 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:43:12,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:43:12,579 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-08 12:43:12,580 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:43:12,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:43:12,588 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 12:43:12,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:12 BoogieIcfgContainer [2024-11-08 12:43:12,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:43:12,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:43:12,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:43:12,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:43:12,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:43:11" (1/3) ... [2024-11-08 12:43:12,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13299f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:43:12, skipping insertion in model container [2024-11-08 12:43:12,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:43:12" (2/3) ... [2024-11-08 12:43:12,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13299f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:43:12, skipping insertion in model container [2024-11-08 12:43:12,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:43:12" (3/3) ... [2024-11-08 12:43:12,594 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-11-08 12:43:12,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:43:12,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 12:43:12,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:43:12,653 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;@4c32de3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:43:12,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 12:43:12,656 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-08 12:43:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 12:43:12,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:12,663 INFO L215 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-08 12:43:12,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1842866032, now seen corresponding path program 1 times [2024-11-08 12:43:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519738547] [2024-11-08 12:43:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:12,687 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-08 12:43:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:12,691 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-08 12:43:12,691 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-08 12:43:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:12,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 12:43:12,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:12,782 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-08 12:43:12,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:12,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:12,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519738547] [2024-11-08 12:43:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519738547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:12,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:43:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303908220] [2024-11-08 12:43:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:43:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:43:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:43:12,806 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-08 12:43:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:12,823 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2024-11-08 12:43:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:43:12,825 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-08 12:43:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:12,830 INFO L225 Difference]: With dead ends: 89 [2024-11-08 12:43:12,830 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 12:43:12,833 INFO L431 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-08 12:43:12,835 INFO L432 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-08 12:43:12,836 INFO L433 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-08 12:43:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 12:43:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 12:43:12,861 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-08 12:43:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-08 12:43:12,863 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 27 [2024-11-08 12:43:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:12,864 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-08 12:43:12,865 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-08 12:43:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-08 12:43:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 12:43:12,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:12,866 INFO L215 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-08 12:43:12,871 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-08 12:43:13,067 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-08 12:43:13,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -207460078, now seen corresponding path program 1 times [2024-11-08 12:43:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075690560] [2024-11-08 12:43:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:13,071 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-08 12:43:13,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:13,073 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-08 12:43:13,074 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-08 12:43:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:13,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:13,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:13,154 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-08 12:43:13,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:13,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075690560] [2024-11-08 12:43:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075690560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:13,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038242409] [2024-11-08 12:43:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:13,158 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-08 12:43:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:13,182 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-11-08 12:43:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:13,182 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-08 12:43:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:13,183 INFO L225 Difference]: With dead ends: 85 [2024-11-08 12:43:13,184 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 12:43:13,185 INFO L431 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-08 12:43:13,186 INFO L432 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-08 12:43:13,186 INFO L433 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-08 12:43:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 12:43:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 12:43:13,193 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-08 12:43:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-08 12:43:13,194 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2024-11-08 12:43:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-08 12:43:13,194 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-08 12:43:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-08 12:43:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 12:43:13,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:13,196 INFO L215 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-08 12:43:13,199 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-08 12:43:13,401 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-08 12:43:13,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:13,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 318152461, now seen corresponding path program 1 times [2024-11-08 12:43:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616001029] [2024-11-08 12:43:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:13,403 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-08 12:43:13,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:13,406 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-08 12:43:13,406 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-08 12:43:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:13,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:13,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:13,538 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-08 12:43:13,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:13,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616001029] [2024-11-08 12:43:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616001029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:13,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:13,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823337837] [2024-11-08 12:43:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:13,545 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-08 12:43:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:13,571 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-08 12:43:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:13,571 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-08 12:43:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:13,573 INFO L225 Difference]: With dead ends: 74 [2024-11-08 12:43:13,573 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 12:43:13,573 INFO L431 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-08 12:43:13,574 INFO L432 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-08 12:43:13,575 INFO L433 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-08 12:43:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 12:43:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 12:43:13,583 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-08 12:43:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 12:43:13,584 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2024-11-08 12:43:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 12:43:13,584 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-08 12:43:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-08 12:43:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 12:43:13,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:13,586 INFO L215 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-08 12:43:13,589 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-08 12:43:13,789 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-08 12:43:13,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:13,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash 810873816, now seen corresponding path program 1 times [2024-11-08 12:43:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:13,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17033299] [2024-11-08 12:43:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:13,791 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-08 12:43:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:13,794 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-08 12:43:13,795 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-08 12:43:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:13,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:13,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:13,892 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-08 12:43:13,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:13,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:13,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17033299] [2024-11-08 12:43:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17033299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965504288] [2024-11-08 12:43:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:13,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:13,898 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-08 12:43:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:13,924 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-08 12:43:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:13,925 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-08 12:43:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:13,941 INFO L225 Difference]: With dead ends: 77 [2024-11-08 12:43:13,941 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 12:43:13,941 INFO L431 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-08 12:43:13,942 INFO L432 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-08 12:43:13,942 INFO L433 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-08 12:43:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 12:43:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-08 12:43:13,947 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-08 12:43:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 12:43:13,948 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 34 [2024-11-08 12:43:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:13,948 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 12:43:13,948 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-08 12:43:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-08 12:43:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 12:43:13,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:13,949 INFO L215 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-08 12:43:13,953 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-08 12:43:14,152 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-08 12:43:14,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2026721905, now seen corresponding path program 1 times [2024-11-08 12:43:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477408864] [2024-11-08 12:43:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:14,154 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-08 12:43:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:14,157 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-08 12:43:14,157 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-08 12:43:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:14,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:14,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:14,216 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-08 12:43:14,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:14,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477408864] [2024-11-08 12:43:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477408864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150101908] [2024-11-08 12:43:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:14,220 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-08 12:43:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:14,233 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-08 12:43:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:14,234 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-08 12:43:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:14,235 INFO L225 Difference]: With dead ends: 77 [2024-11-08 12:43:14,235 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 12:43:14,235 INFO L431 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-08 12:43:14,236 INFO L432 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-08 12:43:14,236 INFO L433 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-08 12:43:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 12:43:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-08 12:43:14,240 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-08 12:43:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 12:43:14,241 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 35 [2024-11-08 12:43:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 12:43:14,241 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-08 12:43:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-08 12:43:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 12:43:14,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:14,242 INFO L215 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-08 12:43:14,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 12:43:14,446 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-08 12:43:14,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:14,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -110305028, now seen corresponding path program 1 times [2024-11-08 12:43:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332179962] [2024-11-08 12:43:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:14,447 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-08 12:43:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:14,450 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-08 12:43:14,451 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-08 12:43:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:14,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:14,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:14,524 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-08 12:43:14,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:14,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332179962] [2024-11-08 12:43:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332179962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69017684] [2024-11-08 12:43:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:14,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:14,530 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-08 12:43:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:14,550 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-08 12:43:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:14,551 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-08 12:43:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:14,552 INFO L225 Difference]: With dead ends: 77 [2024-11-08 12:43:14,555 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 12:43:14,555 INFO L431 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-08 12:43:14,556 INFO L432 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-08 12:43:14,556 INFO L433 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-08 12:43:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 12:43:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-08 12:43:14,564 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-08 12:43:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 12:43:14,565 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2024-11-08 12:43:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 12:43:14,565 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-08 12:43:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-08 12:43:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 12:43:14,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:14,566 INFO L215 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-08 12:43:14,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 12:43:14,769 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-08 12:43:14,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:14,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -403708035, now seen corresponding path program 1 times [2024-11-08 12:43:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146091706] [2024-11-08 12:43:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:14,773 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-08 12:43:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:14,776 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-08 12:43:14,780 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-08 12:43:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:14,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:43:14,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:15,173 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-08 12:43:15,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:15,534 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-08 12:43:15,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146091706] [2024-11-08 12:43:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146091706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:15,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-08 12:43:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329916218] [2024-11-08 12:43:15,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:15,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:43:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:43:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:43:15,540 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-08 12:43:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:16,171 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2024-11-08 12:43:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:43:16,172 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-08 12:43:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:16,173 INFO L225 Difference]: With dead ends: 96 [2024-11-08 12:43:16,173 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 12:43:16,173 INFO L431 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-08 12:43:16,174 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:16,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 542 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 12:43:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 12:43:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-11-08 12:43:16,192 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-08 12:43:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2024-11-08 12:43:16,199 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 36 [2024-11-08 12:43:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2024-11-08 12:43:16,200 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-08 12:43:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-08 12:43:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 12:43:16,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:16,201 INFO L215 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-08 12:43:16,210 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-08 12:43:16,401 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-08 12:43:16,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1637683364, now seen corresponding path program 1 times [2024-11-08 12:43:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789995206] [2024-11-08 12:43:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:16,403 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-08 12:43:16,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:16,407 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-08 12:43:16,409 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-08 12:43:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:16,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:43:16,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:16,707 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-08 12:43:16,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:16,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789995206] [2024-11-08 12:43:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789995206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:43:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482723724] [2024-11-08 12:43:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:16,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:43:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:16,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:43:16,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:43:16,709 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-08 12:43:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:17,022 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2024-11-08 12:43:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:43:17,023 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-08 12:43:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:17,024 INFO L225 Difference]: With dead ends: 119 [2024-11-08 12:43:17,024 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 12:43:17,024 INFO L431 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-08 12:43:17,025 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:17,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 482 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:43:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 12:43:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2024-11-08 12:43:17,030 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-08 12:43:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2024-11-08 12:43:17,031 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 38 [2024-11-08 12:43:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2024-11-08 12:43:17,031 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-08 12:43:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2024-11-08 12:43:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 12:43:17,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:17,032 INFO L215 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-08 12:43:17,042 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-08 12:43:17,241 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-08 12:43:17,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -987503231, now seen corresponding path program 1 times [2024-11-08 12:43:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439205087] [2024-11-08 12:43:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:17,243 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-08 12:43:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:17,246 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-08 12:43:17,246 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-08 12:43:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:17,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:43:17,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:17,442 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-08 12:43:17,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:17,586 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-08 12:43:17,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439205087] [2024-11-08 12:43:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439205087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:17,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-08 12:43:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246194357] [2024-11-08 12:43:17,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:17,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 12:43:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:17,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 12:43:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-08 12:43:17,589 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-08 12:43:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:17,851 INFO L93 Difference]: Finished difference Result 108 states and 152 transitions. [2024-11-08 12:43:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:43:17,851 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-08 12:43:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:17,852 INFO L225 Difference]: With dead ends: 108 [2024-11-08 12:43:17,852 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 12:43:17,853 INFO L431 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-08 12:43:17,853 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:17,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:43:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 12:43:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2024-11-08 12:43:17,859 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-08 12:43:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-08 12:43:17,860 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 41 [2024-11-08 12:43:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-08 12:43:17,860 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-08 12:43:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-08 12:43:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 12:43:17,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:17,870 INFO L215 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-08 12:43:17,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 12:43:18,070 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-08 12:43:18,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1947898161, now seen corresponding path program 1 times [2024-11-08 12:43:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951823949] [2024-11-08 12:43:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:18,072 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-08 12:43:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:18,074 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-08 12:43:18,076 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-08 12:43:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:18,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 12:43:18,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:18,140 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-08 12:43:18,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:18,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951823949] [2024-11-08 12:43:18,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951823949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:18,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:18,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:43:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469933593] [2024-11-08 12:43:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:43:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:43:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:43:18,142 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-08 12:43:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:18,169 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2024-11-08 12:43:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:43:18,170 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-08 12:43:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:18,170 INFO L225 Difference]: With dead ends: 83 [2024-11-08 12:43:18,171 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 12:43:18,171 INFO L431 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-08 12:43:18,171 INFO L432 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-08 12:43:18,172 INFO L433 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-08 12:43:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 12:43:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-08 12:43:18,177 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-08 12:43:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-08 12:43:18,178 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 43 [2024-11-08 12:43:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:18,178 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-08 12:43:18,178 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-08 12:43:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-08 12:43:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 12:43:18,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:18,179 INFO L215 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-08 12:43:18,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 12:43:18,380 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-08 12:43:18,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1178252102, now seen corresponding path program 1 times [2024-11-08 12:43:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782706179] [2024-11-08 12:43:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:18,381 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-08 12:43:18,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:18,386 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-08 12:43:18,390 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-08 12:43:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:18,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:18,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:18,473 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-08 12:43:18,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:18,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782706179] [2024-11-08 12:43:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782706179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787798918] [2024-11-08 12:43:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:18,475 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-08 12:43:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:18,496 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-08 12:43:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:18,497 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-08 12:43:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:18,497 INFO L225 Difference]: With dead ends: 109 [2024-11-08 12:43:18,497 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 12:43:18,498 INFO L431 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-08 12:43:18,498 INFO L432 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-08 12:43:18,498 INFO L433 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-08 12:43:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 12:43:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 12:43:18,504 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-08 12:43:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-08 12:43:18,505 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 46 [2024-11-08 12:43:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-08 12:43:18,506 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-08 12:43:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-08 12:43:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 12:43:18,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:18,507 INFO L215 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-08 12:43:18,510 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-08 12:43:18,710 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-08 12:43:18,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -101611576, now seen corresponding path program 1 times [2024-11-08 12:43:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132918657] [2024-11-08 12:43:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:43:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:18,712 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-08 12:43:18,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 12:43:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:18,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 12:43:18,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:19,254 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-08 12:43:19,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:20,114 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-08 12:43:20,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132918657] [2024-11-08 12:43:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132918657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:20,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-08 12:43:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589431992] [2024-11-08 12:43:20,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:43:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:20,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:43:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-08 12:43:20,115 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-08 12:43:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:20,922 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2024-11-08 12:43:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:43:20,922 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-08 12:43:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:20,923 INFO L225 Difference]: With dead ends: 147 [2024-11-08 12:43:20,923 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 12:43:20,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-11-08 12:43:20,924 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:20,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 752 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 12:43:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 12:43:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2024-11-08 12:43:20,930 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-08 12:43:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-08 12:43:20,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 46 [2024-11-08 12:43:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:20,931 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-08 12:43:20,931 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-08 12:43:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-08 12:43:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 12:43:20,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:20,932 INFO L215 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-08 12:43:20,937 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-08 12:43:21,132 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-08 12:43:21,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1695459100, now seen corresponding path program 1 times [2024-11-08 12:43:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969230083] [2024-11-08 12:43:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:21,134 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-08 12:43:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:21,135 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-08 12:43:21,136 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-08 12:43:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:21,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:21,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:21,222 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-08 12:43:21,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:21,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969230083] [2024-11-08 12:43:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969230083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364325130] [2024-11-08 12:43:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:21,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:21,224 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-08 12:43:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:21,243 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2024-11-08 12:43:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:21,243 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-08 12:43:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:21,244 INFO L225 Difference]: With dead ends: 113 [2024-11-08 12:43:21,244 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 12:43:21,244 INFO L431 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-08 12:43:21,244 INFO L432 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-08 12:43:21,245 INFO L433 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-08 12:43:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 12:43:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-08 12:43:21,250 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-08 12:43:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-11-08 12:43:21,250 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 48 [2024-11-08 12:43:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-11-08 12:43:21,251 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-08 12:43:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-11-08 12:43:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 12:43:21,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:21,251 INFO L215 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-08 12:43:21,258 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-08 12:43:21,454 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-08 12:43:21,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1319644518, now seen corresponding path program 1 times [2024-11-08 12:43:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122908228] [2024-11-08 12:43:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:21,456 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-08 12:43:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:21,458 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-08 12:43:21,459 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-08 12:43:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:21,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 12:43:21,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:21,787 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-08 12:43:21,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:22,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122908228] [2024-11-08 12:43:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122908228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:43:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543759517] [2024-11-08 12:43:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 12:43:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 12:43:22,295 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-08 12:43:22,296 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-08 12:43:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:22,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 12:43:22,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:22,675 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-08 12:43:22,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543759517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:43:22,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-11-08 12:43:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28207213] [2024-11-08 12:43:22,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:22,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:43:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:43:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:43:22,851 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-08 12:43:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:23,272 INFO L93 Difference]: Finished difference Result 139 states and 200 transitions. [2024-11-08 12:43:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:43:23,272 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-08 12:43:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:23,273 INFO L225 Difference]: With dead ends: 139 [2024-11-08 12:43:23,273 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 12:43:23,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-08 12:43:23,274 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:23,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 482 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:43:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 12:43:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2024-11-08 12:43:23,288 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-08 12:43:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-08 12:43:23,289 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 48 [2024-11-08 12:43:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-08 12:43:23,289 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-08 12:43:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-08 12:43:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 12:43:23,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:23,290 INFO L215 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-08 12:43:23,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-08 12:43:23,496 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 (15)] Ended with exit code 0 [2024-11-08 12:43:23,695 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-08 12:43:23,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:23,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash -458335062, now seen corresponding path program 1 times [2024-11-08 12:43:23,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:23,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161347793] [2024-11-08 12:43:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:43:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:23,698 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-08 12:43:23,701 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-08 12:43:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:23,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:43:23,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:23,960 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-08 12:43:23,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:24,753 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-08 12:43:24,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161347793] [2024-11-08 12:43:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161347793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:24,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-08 12:43:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5259819] [2024-11-08 12:43:24,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:43:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:43:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:43:24,755 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-08 12:43:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:24,997 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2024-11-08 12:43:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:25,000 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-08 12:43:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:25,001 INFO L225 Difference]: With dead ends: 110 [2024-11-08 12:43:25,001 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 12:43:25,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 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-08 12:43:25,002 INFO L432 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-08 12:43:25,002 INFO L433 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-08 12:43:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 12:43:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-08 12:43:25,006 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-08 12:43:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-08 12:43:25,007 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 48 [2024-11-08 12:43:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:25,007 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-08 12:43:25,007 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-08 12:43:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-08 12:43:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 12:43:25,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:25,007 INFO L215 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-08 12:43:25,017 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 (17)] Ended with exit code 0 [2024-11-08 12:43:25,208 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-08 12:43:25,208 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1205492313, now seen corresponding path program 1 times [2024-11-08 12:43:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178212591] [2024-11-08 12:43:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:25,209 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-08 12:43:25,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:25,210 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-08 12:43:25,212 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-08 12:43:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:25,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 12:43:25,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:25,366 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-08 12:43:25,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:25,489 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-08 12:43:25,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178212591] [2024-11-08 12:43:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178212591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:25,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-11-08 12:43:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121332893] [2024-11-08 12:43:25,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:43:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:43:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:43:25,491 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-08 12:43:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:25,718 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2024-11-08 12:43:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:25,718 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-08 12:43:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:25,719 INFO L225 Difference]: With dead ends: 117 [2024-11-08 12:43:25,719 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 12:43:25,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-08 12:43:25,720 INFO L432 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-08 12:43:25,720 INFO L433 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-08 12:43:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 12:43:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-08 12:43:25,723 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-08 12:43:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-11-08 12:43:25,723 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 48 [2024-11-08 12:43:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:25,723 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-11-08 12:43:25,724 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-08 12:43:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-11-08 12:43:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 12:43:25,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:25,727 INFO L215 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-08 12:43:25,731 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 (18)] Forceful destruction successful, exit code 0 [2024-11-08 12:43:25,930 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-08 12:43:25,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:25,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1014505839, now seen corresponding path program 1 times [2024-11-08 12:43:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456456238] [2024-11-08 12:43:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:25,931 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-08 12:43:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:25,934 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-08 12:43:25,934 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-08 12:43:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:26,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:43:26,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:26,110 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-08 12:43:26,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:26,222 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-08 12:43:26,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456456238] [2024-11-08 12:43:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456456238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:26,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-08 12:43:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131379405] [2024-11-08 12:43:26,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 12:43:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 12:43:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 12:43:26,223 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-08 12:43:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:26,387 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2024-11-08 12:43:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:26,387 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-08 12:43:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:26,388 INFO L225 Difference]: With dead ends: 86 [2024-11-08 12:43:26,388 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 12:43:26,388 INFO L431 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-08 12:43:26,389 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:26,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 415 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:43:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 12:43:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-08 12:43:26,391 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-08 12:43:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-08 12:43:26,392 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 48 [2024-11-08 12:43:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:26,392 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-08 12:43:26,392 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-08 12:43:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-08 12:43:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 12:43:26,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:26,393 INFO L215 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-08 12:43:26,400 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 (19)] Ended with exit code 0 [2024-11-08 12:43:26,596 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-08 12:43:26,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1319000567, now seen corresponding path program 1 times [2024-11-08 12:43:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577811128] [2024-11-08 12:43:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:26,597 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-08 12:43:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:26,601 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-08 12:43:26,602 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-08 12:43:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:26,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:26,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:26,668 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-08 12:43:26,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:26,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577811128] [2024-11-08 12:43:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577811128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:26,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313205905] [2024-11-08 12:43:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:26,669 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-08 12:43:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:26,684 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2024-11-08 12:43:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:26,684 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-08 12:43:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:26,685 INFO L225 Difference]: With dead ends: 98 [2024-11-08 12:43:26,685 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 12:43:26,685 INFO L431 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-08 12:43:26,685 INFO L432 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-08 12:43:26,686 INFO L433 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-08 12:43:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 12:43:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-08 12:43:26,690 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-08 12:43:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-08 12:43:26,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2024-11-08 12:43:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-08 12:43:26,691 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-08 12:43:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-08 12:43:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 12:43:26,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:26,692 INFO L215 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-08 12:43:26,701 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-08 12:43:26,892 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-08 12:43:26,892 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 584647616, now seen corresponding path program 1 times [2024-11-08 12:43:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61720560] [2024-11-08 12:43:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:26,893 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-08 12:43:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:26,894 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-08 12:43:26,897 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-08 12:43:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:26,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:26,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:26,963 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-08 12:43:26,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:26,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61720560] [2024-11-08 12:43:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61720560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:26,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:26,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432981846] [2024-11-08 12:43:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:26,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:26,965 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-08 12:43:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:26,983 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2024-11-08 12:43:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:26,983 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-08 12:43:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:26,984 INFO L225 Difference]: With dead ends: 96 [2024-11-08 12:43:26,984 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 12:43:26,984 INFO L431 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-08 12:43:26,984 INFO L432 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-08 12:43:26,985 INFO L433 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-08 12:43:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 12:43:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-08 12:43:26,987 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-08 12:43:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-08 12:43:26,988 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 50 [2024-11-08 12:43:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-08 12:43:26,988 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-08 12:43:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-08 12:43:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 12:43:26,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:26,988 INFO L215 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-08 12:43:26,995 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-08 12:43:27,192 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-08 12:43:27,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:27,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -412424737, now seen corresponding path program 1 times [2024-11-08 12:43:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:27,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159617831] [2024-11-08 12:43:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:27,193 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-08 12:43:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:27,194 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-08 12:43:27,196 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-08 12:43:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:27,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 12:43:27,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:27,388 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-08 12:43:27,390 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-08 12:43:27,644 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-08 12:43:27,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:27,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159617831] [2024-11-08 12:43:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159617831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:27,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 12:43:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11906243] [2024-11-08 12:43:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:43:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:43:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:43:27,647 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-08 12:43:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:28,187 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2024-11-08 12:43:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 12:43:28,188 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-08 12:43:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:28,189 INFO L225 Difference]: With dead ends: 70 [2024-11-08 12:43:28,189 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 12:43:28,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:43:28,189 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:28,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:43:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 12:43:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-08 12:43:28,192 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-08 12:43:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-08 12:43:28,192 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 50 [2024-11-08 12:43:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:28,192 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-08 12:43:28,193 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-08 12:43:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-08 12:43:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 12:43:28,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:28,193 INFO L215 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-08 12:43:28,196 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 (22)] Ended with exit code 0 [2024-11-08 12:43:28,396 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-08 12:43:28,396 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1377347757, now seen corresponding path program 1 times [2024-11-08 12:43:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28969229] [2024-11-08 12:43:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:28,397 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-08 12:43:28,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:28,402 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-08 12:43:28,404 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-08 12:43:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:28,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 12:43:28,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:28,772 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-08 12:43:28,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:29,481 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-08 12:43:29,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28969229] [2024-11-08 12:43:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28969229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:29,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-08 12:43:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195361313] [2024-11-08 12:43:29,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 12:43:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 12:43:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-08 12:43:29,484 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-08 12:43:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:29,998 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-11-08 12:43:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:43:29,999 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-08 12:43:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:29,999 INFO L225 Difference]: With dead ends: 78 [2024-11-08 12:43:30,000 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 12:43:30,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2024-11-08 12:43:30,000 INFO L432 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-08 12:43:30,001 INFO L433 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-08 12:43:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 12:43:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-08 12:43:30,003 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-08 12:43:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-08 12:43:30,004 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2024-11-08 12:43:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:30,004 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-08 12:43:30,005 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-08 12:43:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-08 12:43:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 12:43:30,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:30,005 INFO L215 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-08 12:43:30,009 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-08 12:43:30,209 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-08 12:43:30,209 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1696305608, now seen corresponding path program 1 times [2024-11-08 12:43:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827219135] [2024-11-08 12:43:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:30,210 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-08 12:43:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:30,211 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-08 12:43:30,212 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-08 12:43:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:30,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 12:43:30,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:30,386 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-08 12:43:30,387 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-08 12:43:30,421 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-08 12:43:30,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:30,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827219135] [2024-11-08 12:43:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827219135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:30,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:43:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783187784] [2024-11-08 12:43:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:43:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:43:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:43:30,423 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-08 12:43:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:30,660 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-08 12:43:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:30,664 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-08 12:43:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:30,664 INFO L225 Difference]: With dead ends: 66 [2024-11-08 12:43:30,664 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 12:43:30,664 INFO L431 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-08 12:43:30,665 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 12:43:30,665 INFO L433 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-08 12:43:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 12:43:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-08 12:43:30,670 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-08 12:43:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-08 12:43:30,670 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 60 [2024-11-08 12:43:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-08 12:43:30,671 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-08 12:43:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-08 12:43:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 12:43:30,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:30,671 INFO L215 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-08 12:43:30,681 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 (24)] Ended with exit code 0 [2024-11-08 12:43:30,874 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-08 12:43:30,875 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1055709639, now seen corresponding path program 1 times [2024-11-08 12:43:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108483258] [2024-11-08 12:43:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:30,876 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-08 12:43:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:30,877 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-08 12:43:30,878 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-08 12:43:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:30,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 12:43:30,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:31,109 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-08 12:43:31,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:31,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:31,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108483258] [2024-11-08 12:43:31,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108483258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:43:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013203386] [2024-11-08 12:43:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:31,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:43:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:43:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:43:31,111 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-08 12:43:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:31,411 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-08 12:43:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:31,411 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-08 12:43:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:31,412 INFO L225 Difference]: With dead ends: 68 [2024-11-08 12:43:31,412 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 12:43:31,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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-08 12:43:31,413 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 12:43:31,413 INFO L433 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-08 12:43:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 12:43:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-08 12:43:31,415 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-08 12:43:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-08 12:43:31,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 61 [2024-11-08 12:43:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:31,416 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-08 12:43:31,416 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-08 12:43:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-08 12:43:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 12:43:31,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:31,417 INFO L215 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-08 12:43:31,420 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 (25)] Ended with exit code 0 [2024-11-08 12:43:31,620 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-08 12:43:31,620 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:31,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash -187739156, now seen corresponding path program 1 times [2024-11-08 12:43:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:31,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800677388] [2024-11-08 12:43:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:31,621 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-08 12:43:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:31,624 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-08 12:43:31,625 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-08 12:43:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:31,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 12:43:31,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:31,830 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-08 12:43:31,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:31,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800677388] [2024-11-08 12:43:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800677388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:31,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:31,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:43:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538589252] [2024-11-08 12:43:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:43:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:43:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:43:31,832 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-08 12:43:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:32,082 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-08 12:43:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:32,087 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-08 12:43:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:32,087 INFO L225 Difference]: With dead ends: 68 [2024-11-08 12:43:32,087 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 12:43:32,088 INFO L431 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-08 12:43:32,088 INFO L432 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-08 12:43:32,088 INFO L433 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-08 12:43:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 12:43:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-08 12:43:32,094 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-08 12:43:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-08 12:43:32,094 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2024-11-08 12:43:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-08 12:43:32,095 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-08 12:43:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-08 12:43:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 12:43:32,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:32,095 INFO L215 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-08 12:43:32,099 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-08 12:43:32,296 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-08 12:43:32,296 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1230639261, now seen corresponding path program 1 times [2024-11-08 12:43:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:32,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76128298] [2024-11-08 12:43:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:32,297 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-08 12:43:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:32,299 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-08 12:43:32,300 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-08 12:43:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:32,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 12:43:32,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:32,473 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-08 12:43:32,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:32,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76128298] [2024-11-08 12:43:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76128298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:43:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137978956] [2024-11-08 12:43:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:43:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:43:32,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:43:32,474 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-08 12:43:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:32,719 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-08 12:43:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:32,720 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-08 12:43:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:32,721 INFO L225 Difference]: With dead ends: 65 [2024-11-08 12:43:32,721 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 12:43:32,721 INFO L431 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-08 12:43:32,721 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:32,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 262 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:43:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 12:43:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-08 12:43:32,724 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-08 12:43:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-08 12:43:32,724 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 63 [2024-11-08 12:43:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:32,725 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-08 12:43:32,725 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-08 12:43:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-08 12:43:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 12:43:32,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:32,725 INFO L215 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-08 12:43:32,730 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-08 12:43:32,929 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-08 12:43:32,929 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1065424800, now seen corresponding path program 1 times [2024-11-08 12:43:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001990920] [2024-11-08 12:43:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:32,930 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-08 12:43:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:32,931 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-08 12:43:32,933 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-08 12:43:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:32,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 12:43:32,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:33,012 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-08 12:43:33,015 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-08 12:43:33,115 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-08 12:43:33,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:33,346 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-08 12:43:33,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001990920] [2024-11-08 12:43:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001990920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:33,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-08 12:43:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591406660] [2024-11-08 12:43:33,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:43:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:43:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:43:33,347 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-08 12:43:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:33,670 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-08 12:43:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:43:33,670 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-08 12:43:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:33,671 INFO L225 Difference]: With dead ends: 64 [2024-11-08 12:43:33,671 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 12:43:33,671 INFO L431 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-08 12:43:33,671 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:33,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 347 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:43:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 12:43:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-08 12:43:33,677 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-08 12:43:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-08 12:43:33,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2024-11-08 12:43:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:33,678 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-08 12:43:33,678 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-08 12:43:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-08 12:43:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 12:43:33,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:33,680 INFO L215 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-08 12:43:33,686 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-08 12:43:33,880 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-08 12:43:33,880 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:33,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash -846570082, now seen corresponding path program 1 times [2024-11-08 12:43:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48893958] [2024-11-08 12:43:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:33,881 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-08 12:43:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:33,883 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-08 12:43:33,884 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-08 12:43:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:33,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:43:33,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:33,963 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-08 12:43:33,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:43:33,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:33,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48893958] [2024-11-08 12:43:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48893958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:43:33,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:43:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:43:33,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694761189] [2024-11-08 12:43:33,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:43:33,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:43:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:43:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:43:33,964 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-08 12:43:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:33,991 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-11-08 12:43:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:43:33,991 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-08 12:43:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:33,991 INFO L225 Difference]: With dead ends: 66 [2024-11-08 12:43:33,991 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 12:43:33,991 INFO L431 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-08 12:43:33,992 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:43:33,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:43:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 12:43:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-08 12:43:33,994 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-08 12:43:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-08 12:43:33,994 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2024-11-08 12:43:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-08 12:43:33,994 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-08 12:43:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-08 12:43:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 12:43:33,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:43:33,995 INFO L215 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-08 12:43:33,999 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 (29)] Ended with exit code 0 [2024-11-08 12:43:34,198 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-08 12:43:34,198 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:43:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:43:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2063488209, now seen corresponding path program 1 times [2024-11-08 12:43:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:43:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092208091] [2024-11-08 12:43:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:43:34,199 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-08 12:43:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:43:34,201 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-08 12:43:34,210 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-08 12:43:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:43:34,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:43:34,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:43:34,395 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-08 12:43:34,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:43:34,538 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-08 12:43:34,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:43:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092208091] [2024-11-08 12:43:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092208091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:43:34,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:43:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-08 12:43:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157122427] [2024-11-08 12:43:34,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:43:34,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:43:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:43:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:43:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:43:34,539 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-08 12:43:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:43:34,659 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-08 12:43:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:43:34,660 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-08 12:43:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:43:34,660 INFO L225 Difference]: With dead ends: 46 [2024-11-08 12:43:34,660 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 12:43:34,661 INFO L431 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-08 12:43:34,661 INFO L432 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-08 12:43:34,661 INFO L433 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-08 12:43:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 12:43:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 12:43:34,661 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-08 12:43:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 12:43:34,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-11-08 12:43:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:43:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 12:43:34,662 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-08 12:43:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 12:43:34,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 12:43:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 12:43:34,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 12:43:34,668 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 (30)] Ended with exit code 0 [2024-11-08 12:43:34,865 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-08 12:43:34,868 INFO L407 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-08 12:43:34,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 12:43:35,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:43:35,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-08 12:43:35,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-08 12:43:35,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 12:43:35,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 12:43:35,521 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-08 12:43:35,521 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-08 12:43:35,531 INFO L158 Benchmark]: Toolchain (without parser) took 23621.54ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 55.4MB in the beginning and 79.9MB in the end (delta: -24.6MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,531 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 92.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:43:35,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.73ms. Allocated memory is still 92.3MB. Free memory was 55.3MB in the beginning and 69.1MB in the end (delta: -13.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 67.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,531 INFO L158 Benchmark]: Boogie Preprocessor took 50.73ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 64.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,532 INFO L158 Benchmark]: RCFGBuilder took 355.17ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 48.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,532 INFO L158 Benchmark]: TraceAbstraction took 22940.83ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 48.1MB in the beginning and 79.9MB in the end (delta: -31.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-08 12:43:35,532 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.65ms. Allocated memory is still 92.3MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.73ms. Allocated memory is still 92.3MB. Free memory was 55.3MB in the beginning and 69.1MB in the end (delta: -13.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.31ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 67.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.73ms. Allocated memory is still 92.3MB. Free memory was 67.3MB in the beginning and 64.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.17ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 48.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22940.83ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 48.1MB in the beginning and 79.9MB in the end (delta: -31.8MB). Peak memory consumption was 81.8MB. 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: 76]: 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: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 8394 SdHoareTripleChecker+Invalid, 4.0s 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, 3.9s 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.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 161 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.0s 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: 25]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 57]: 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-08 12:43:35,563 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.