/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 03:15:35,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 03:15:35,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 03:15:35,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 03:15:35,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 03:15:35,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 03:15:35,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 03:15:35,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 03:15:35,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 03:15:35,319 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 03:15:35,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 03:15:35,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 03:15:35,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 03:15:35,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 03:15:35,321 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 03:15:35,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 03:15:35,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 03:15:35,322 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 03:15:35,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 03:15:35,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 03:15:35,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 03:15:35,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 03:15:35,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 03:15:35,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 03:15:35,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 03:15:35,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 03:15:35,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 03:15:35,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 03:15:35,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 03:15:35,325 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 03:15:35,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 03:15:35,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 03:15:35,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 03:15:35,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 03:15:35,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 03:15:35,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 03:15:35,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 03:15:35,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 03:15:35,328 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 03:15:35,328 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 [2023-12-22 03:15:35,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 03:15:35,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 03:15:35,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 03:15:35,560 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 03:15:35,561 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 03:15:35,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c [2023-12-22 03:15:36,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 03:15:36,751 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 03:15:36,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c [2023-12-22 03:15:36,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567ec3794/6edd4c161aae40d2a3ae6f28b467667e/FLAG7c0f96e9b [2023-12-22 03:15:36,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567ec3794/6edd4c161aae40d2a3ae6f28b467667e [2023-12-22 03:15:36,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 03:15:36,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 03:15:36,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 03:15:36,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 03:15:36,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 03:15:36,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:15:36" (1/1) ... [2023-12-22 03:15:36,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1448ac0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:36, skipping insertion in model container [2023-12-22 03:15:36,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:15:36" (1/1) ... [2023-12-22 03:15:36,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 03:15:36,926 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2023-12-22 03:15:36,934 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2023-12-22 03:15:36,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 03:15:36,970 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 03:15:36,979 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2023-12-22 03:15:36,980 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2023-12-22 03:15:36,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 03:15:37,010 INFO L206 MainTranslator]: Completed translation [2023-12-22 03:15:37,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37 WrapperNode [2023-12-22 03:15:37,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 03:15:37,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 03:15:37,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 03:15:37,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 03:15:37,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,044 INFO L138 Inliner]: procedures = 28, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 167 [2023-12-22 03:15:37,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 03:15:37,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 03:15:37,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 03:15:37,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 03:15:37,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,069 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-22 03:15:37,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 03:15:37,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 03:15:37,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 03:15:37,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 03:15:37,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (1/1) ... [2023-12-22 03:15:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 03:15:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 03:15:37,117 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) [2023-12-22 03:15:37,132 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 [2023-12-22 03:15:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 03:15:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 03:15:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-22 03:15:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-22 03:15:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 03:15:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 03:15:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-22 03:15:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-22 03:15:37,190 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 03:15:37,192 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 03:15:41,712 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 03:15:41,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 03:15:41,744 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-22 03:15:41,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:15:41 BoogieIcfgContainer [2023-12-22 03:15:41,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 03:15:41,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 03:15:41,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 03:15:41,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 03:15:41,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 03:15:36" (1/3) ... [2023-12-22 03:15:41,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6480811c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:15:41, skipping insertion in model container [2023-12-22 03:15:41,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:15:37" (2/3) ... [2023-12-22 03:15:41,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6480811c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:15:41, skipping insertion in model container [2023-12-22 03:15:41,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:15:41" (3/3) ... [2023-12-22 03:15:41,753 INFO L112 eAbstractionObserver]: Analyzing ICFG square_8+soft_float_1-3a.c.cil.c [2023-12-22 03:15:41,766 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 03:15:41,766 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 03:15:41,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 03:15:41,811 INFO L357 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, mHoare=true, 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;@22677f12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 03:15:41,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 03:15:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 61 states have (on average 1.639344262295082) internal successors, (100), 65 states have internal predecessors, (100), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-22 03:15:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 03:15:41,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:15:41,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 03:15:41,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:15:41,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:15:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 607753738, now seen corresponding path program 1 times [2023-12-22 03:15:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:15:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324328159] [2023-12-22 03:15:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:15:41,839 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 [2023-12-22 03:15:41,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:15:41,841 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) [2023-12-22 03:15:41,842 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 [2023-12-22 03:15:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:15:42,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 03:15:42,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:15:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 03:15:42,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:15:42,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:15:42,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324328159] [2023-12-22 03:15:42,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324328159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:15:42,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:15:42,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 03:15:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894885707] [2023-12-22 03:15:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:15:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 03:15:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:15:42,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 03:15:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 03:15:42,232 INFO L87 Difference]: Start difference. First operand has 75 states, 61 states have (on average 1.639344262295082) internal successors, (100), 65 states have internal predecessors, (100), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-12-22 03:15:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:15:42,279 INFO L93 Difference]: Finished difference Result 146 states and 238 transitions. [2023-12-22 03:15:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 03:15:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2023-12-22 03:15:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:15:42,286 INFO L225 Difference]: With dead ends: 146 [2023-12-22 03:15:42,286 INFO L226 Difference]: Without dead ends: 71 [2023-12-22 03:15:42,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 03:15:42,292 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:15:42,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 03:15:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-22 03:15:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-22 03:15:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 61 states have internal predecessors, (88), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-22 03:15:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2023-12-22 03:15:42,331 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 6 [2023-12-22 03:15:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:15:42,331 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2023-12-22 03:15:42,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-12-22 03:15:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2023-12-22 03:15:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 03:15:42,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:15:42,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 03:15:42,346 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 (2)] Forceful destruction successful, exit code 0 [2023-12-22 03:15:42,545 WARN L477 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 [2023-12-22 03:15:42,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:15:42,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:15:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash 607813320, now seen corresponding path program 1 times [2023-12-22 03:15:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:15:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209166837] [2023-12-22 03:15:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:15:42,547 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 [2023-12-22 03:15:42,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:15:42,548 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) [2023-12-22 03:15:42,555 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 [2023-12-22 03:16:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:16:30,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:16:30,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:16:38,662 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:16:46,954 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:16:52,330 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:16:56,437 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-22 03:17:12,783 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:17:21,092 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:17:28,623 WARN L293 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:17:41,016 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:17:49,195 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:17:57,493 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:18:01,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from false [2023-12-22 03:18:05,731 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from true [2023-12-22 03:18:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 03:18:05,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:05,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209166837] [2023-12-22 03:18:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209166837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:18:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122072619] [2023-12-22 03:18:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:05,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:18:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:05,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:18:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-22 03:18:05,734 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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) [2023-12-22 03:18:10,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:18:14,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:18:18,330 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)))) (fp.lt |c_ULTIMATE.start_main1_~IN~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 03:18:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:18,736 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2023-12-22 03:18:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:18:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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) Word has length 6 [2023-12-22 03:18:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:18,737 INFO L225 Difference]: With dead ends: 71 [2023-12-22 03:18:18,738 INFO L226 Difference]: Without dead ends: 66 [2023-12-22 03:18:18,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2023-12-22 03:18:18,739 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 101 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:18,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 257 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 2 Unknown, 210 Unchecked, 8.7s Time] [2023-12-22 03:18:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-22 03:18:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-22 03:18:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.537037037037037) internal successors, (83), 56 states have internal predecessors, (83), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-22 03:18:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2023-12-22 03:18:18,745 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 100 transitions. Word has length 6 [2023-12-22 03:18:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:18,745 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 100 transitions. [2023-12-22 03:18:18,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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) [2023-12-22 03:18:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2023-12-22 03:18:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-22 03:18:18,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:18,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:18:18,765 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 (3)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:18,957 WARN L477 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 [2023-12-22 03:18:18,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:18,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 830722296, now seen corresponding path program 1 times [2023-12-22 03:18:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176557979] [2023-12-22 03:18:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:18,959 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 [2023-12-22 03:18:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:18,960 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) [2023-12-22 03:18:18,961 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 [2023-12-22 03:18:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:19,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:18:19,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:19,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:18:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:19,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176557979] [2023-12-22 03:18:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176557979] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:18:19,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:18:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-22 03:18:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596293114] [2023-12-22 03:18:19,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:18:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:19,648 INFO L87 Difference]: Start difference. First operand 66 states and 100 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:20,237 INFO L93 Difference]: Finished difference Result 156 states and 247 transitions. [2023-12-22 03:18:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-12-22 03:18:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:20,243 INFO L225 Difference]: With dead ends: 156 [2023-12-22 03:18:20,243 INFO L226 Difference]: Without dead ends: 113 [2023-12-22 03:18:20,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:20,246 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 55 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:20,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 667 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 03:18:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-22 03:18:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2023-12-22 03:18:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 64 states have internal predecessors, (92), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-12-22 03:18:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2023-12-22 03:18:20,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 29 [2023-12-22 03:18:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:20,261 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2023-12-22 03:18:20,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2023-12-22 03:18:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-22 03:18:20,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:20,262 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:20,266 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 [2023-12-22 03:18:20,462 WARN L477 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 [2023-12-22 03:18:20,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:20,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 562813592, now seen corresponding path program 1 times [2023-12-22 03:18:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96062854] [2023-12-22 03:18:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:20,468 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 [2023-12-22 03:18:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:20,469 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) [2023-12-22 03:18:20,469 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 [2023-12-22 03:18:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:20,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:18:20,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:20,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:18:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:21,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96062854] [2023-12-22 03:18:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96062854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:18:21,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:18:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-22 03:18:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220965657] [2023-12-22 03:18:21,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:18:21,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:21,139 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:21,885 INFO L93 Difference]: Finished difference Result 173 states and 270 transitions. [2023-12-22 03:18:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:21,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-12-22 03:18:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:21,889 INFO L225 Difference]: With dead ends: 173 [2023-12-22 03:18:21,889 INFO L226 Difference]: Without dead ends: 127 [2023-12-22 03:18:21,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:21,890 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:21,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 420 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-22 03:18:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-22 03:18:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2023-12-22 03:18:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 20 states have call predecessors, (24), 17 states have call successors, (24) [2023-12-22 03:18:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 183 transitions. [2023-12-22 03:18:21,915 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 183 transitions. Word has length 33 [2023-12-22 03:18:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:21,915 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 183 transitions. [2023-12-22 03:18:21,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 183 transitions. [2023-12-22 03:18:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-22 03:18:21,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:21,917 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:21,922 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 [2023-12-22 03:18:22,119 WARN L477 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 [2023-12-22 03:18:22,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:22,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 820979030, now seen corresponding path program 1 times [2023-12-22 03:18:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424951613] [2023-12-22 03:18:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:22,121 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 [2023-12-22 03:18:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:22,122 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) [2023-12-22 03:18:22,122 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 [2023-12-22 03:18:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:22,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:18:22,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:22,584 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:22,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424951613] [2023-12-22 03:18:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424951613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:22,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:22,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 03:18:22,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592124063] [2023-12-22 03:18:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:22,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:22,586 INFO L87 Difference]: Start difference. First operand 119 states and 183 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:23,282 INFO L93 Difference]: Finished difference Result 271 states and 420 transitions. [2023-12-22 03:18:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-12-22 03:18:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:23,284 INFO L225 Difference]: With dead ends: 271 [2023-12-22 03:18:23,284 INFO L226 Difference]: Without dead ends: 203 [2023-12-22 03:18:23,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:23,285 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 50 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:23,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 420 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-22 03:18:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-22 03:18:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2023-12-22 03:18:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.4431137724550898) internal successors, (241), 166 states have internal predecessors, (241), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2023-12-22 03:18:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 303 transitions. [2023-12-22 03:18:23,299 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 303 transitions. Word has length 33 [2023-12-22 03:18:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:23,300 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 303 transitions. [2023-12-22 03:18:23,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 303 transitions. [2023-12-22 03:18:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-22 03:18:23,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:23,301 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:23,307 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 [2023-12-22 03:18:23,504 WARN L477 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 [2023-12-22 03:18:23,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:23,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1501037400, now seen corresponding path program 1 times [2023-12-22 03:18:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359819855] [2023-12-22 03:18:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:23,505 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 [2023-12-22 03:18:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:23,506 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) [2023-12-22 03:18:23,507 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 [2023-12-22 03:18:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:23,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:18:23,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:24,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:24,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359819855] [2023-12-22 03:18:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359819855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:24,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-22 03:18:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601607181] [2023-12-22 03:18:24,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:24,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:18:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:18:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:24,057 INFO L87 Difference]: Start difference. First operand 199 states and 303 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:25,045 INFO L93 Difference]: Finished difference Result 249 states and 376 transitions. [2023-12-22 03:18:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 03:18:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-12-22 03:18:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:25,046 INFO L225 Difference]: With dead ends: 249 [2023-12-22 03:18:25,046 INFO L226 Difference]: Without dead ends: 187 [2023-12-22 03:18:25,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-22 03:18:25,047 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:25,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 494 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-22 03:18:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-22 03:18:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2023-12-22 03:18:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 155 states have (on average 1.4129032258064516) internal successors, (219), 154 states have internal predecessors, (219), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2023-12-22 03:18:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 269 transitions. [2023-12-22 03:18:25,058 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 269 transitions. Word has length 33 [2023-12-22 03:18:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:25,059 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 269 transitions. [2023-12-22 03:18:25,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 269 transitions. [2023-12-22 03:18:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 03:18:25,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:25,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:25,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:25,263 WARN L477 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 [2023-12-22 03:18:25,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:25,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1373845387, now seen corresponding path program 1 times [2023-12-22 03:18:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973180516] [2023-12-22 03:18:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:25,264 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 [2023-12-22 03:18:25,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:25,265 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) [2023-12-22 03:18:25,266 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 [2023-12-22 03:18:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:25,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 03:18:25,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:25,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:18:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:26,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973180516] [2023-12-22 03:18:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973180516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:18:26,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:18:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-12-22 03:18:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833220044] [2023-12-22 03:18:26,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:18:26,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 03:18:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 03:18:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:18:26,341 INFO L87 Difference]: Start difference. First operand 181 states and 269 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:27,741 INFO L93 Difference]: Finished difference Result 224 states and 332 transitions. [2023-12-22 03:18:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-22 03:18:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-12-22 03:18:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:27,743 INFO L225 Difference]: With dead ends: 224 [2023-12-22 03:18:27,743 INFO L226 Difference]: Without dead ends: 187 [2023-12-22 03:18:27,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-22 03:18:27,744 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:27,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 571 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-22 03:18:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-22 03:18:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2023-12-22 03:18:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 148 states have internal predecessors, (209), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-22 03:18:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2023-12-22 03:18:27,751 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 37 [2023-12-22 03:18:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:27,751 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2023-12-22 03:18:27,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2023-12-22 03:18:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 03:18:27,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:27,753 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:27,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-22 03:18:27,956 WARN L477 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 [2023-12-22 03:18:27,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:27,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1128483641, now seen corresponding path program 1 times [2023-12-22 03:18:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663422823] [2023-12-22 03:18:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:27,960 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 [2023-12-22 03:18:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:27,961 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) [2023-12-22 03:18:27,962 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 [2023-12-22 03:18:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:28,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:18:28,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:28,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:28,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663422823] [2023-12-22 03:18:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663422823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014929934] [2023-12-22 03:18:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:28,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:28,227 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:28,489 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2023-12-22 03:18:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:28,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-22 03:18:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:28,491 INFO L225 Difference]: With dead ends: 321 [2023-12-22 03:18:28,491 INFO L226 Difference]: Without dead ends: 255 [2023-12-22 03:18:28,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:28,492 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:28,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 316 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 03:18:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-22 03:18:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2023-12-22 03:18:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 197 states have (on average 1.365482233502538) internal successors, (269), 196 states have internal predecessors, (269), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2023-12-22 03:18:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2023-12-22 03:18:28,501 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 39 [2023-12-22 03:18:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:28,501 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2023-12-22 03:18:28,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2023-12-22 03:18:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 03:18:28,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:28,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:28,516 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 [2023-12-22 03:18:28,715 WARN L477 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 [2023-12-22 03:18:28,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:28,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1745798990, now seen corresponding path program 1 times [2023-12-22 03:18:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537509349] [2023-12-22 03:18:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:28,717 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 [2023-12-22 03:18:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:28,718 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) [2023-12-22 03:18:28,718 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 [2023-12-22 03:18:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:28,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:18:28,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-22 03:18:28,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:28,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537509349] [2023-12-22 03:18:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537509349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704110376] [2023-12-22 03:18:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:28,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:28,944 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:29,392 INFO L93 Difference]: Finished difference Result 387 states and 552 transitions. [2023-12-22 03:18:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:29,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-12-22 03:18:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:29,394 INFO L225 Difference]: With dead ends: 387 [2023-12-22 03:18:29,395 INFO L226 Difference]: Without dead ends: 167 [2023-12-22 03:18:29,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:29,395 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:29,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 233 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 03:18:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-22 03:18:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2023-12-22 03:18:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 139 states have internal predecessors, (182), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2023-12-22 03:18:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 217 transitions. [2023-12-22 03:18:29,402 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 217 transitions. Word has length 39 [2023-12-22 03:18:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:29,402 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 217 transitions. [2023-12-22 03:18:29,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 217 transitions. [2023-12-22 03:18:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-22 03:18:29,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:29,403 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:29,416 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 [2023-12-22 03:18:29,608 WARN L477 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 [2023-12-22 03:18:29,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:29,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1992155570, now seen corresponding path program 1 times [2023-12-22 03:18:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577853515] [2023-12-22 03:18:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:29,609 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 [2023-12-22 03:18:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:29,610 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) [2023-12-22 03:18:29,614 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 [2023-12-22 03:18:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:29,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 03:18:29,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:30,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:18:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:31,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577853515] [2023-12-22 03:18:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577853515] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 03:18:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 03:18:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-22 03:18:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200889637] [2023-12-22 03:18:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:31,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:18:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:18:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-22 03:18:31,310 INFO L87 Difference]: Start difference. First operand 157 states and 217 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:32,438 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2023-12-22 03:18:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:32,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-12-22 03:18:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:32,440 INFO L225 Difference]: With dead ends: 245 [2023-12-22 03:18:32,440 INFO L226 Difference]: Without dead ends: 209 [2023-12-22 03:18:32,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-22 03:18:32,441 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 37 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:32,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 307 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-22 03:18:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-22 03:18:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2023-12-22 03:18:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 169 states have internal predecessors, (220), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2023-12-22 03:18:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 267 transitions. [2023-12-22 03:18:32,447 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 267 transitions. Word has length 40 [2023-12-22 03:18:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:32,447 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 267 transitions. [2023-12-22 03:18:32,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 267 transitions. [2023-12-22 03:18:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-22 03:18:32,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:32,448 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 03:18:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:32,651 WARN L477 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 [2023-12-22 03:18:32,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:32,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -217148208, now seen corresponding path program 1 times [2023-12-22 03:18:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725599179] [2023-12-22 03:18:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:32,652 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 [2023-12-22 03:18:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:32,653 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) [2023-12-22 03:18:32,654 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 [2023-12-22 03:18:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:32,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:18:32,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:32,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:32,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725599179] [2023-12-22 03:18:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725599179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:18:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394535392] [2023-12-22 03:18:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:32,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:18:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:18:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:32,876 INFO L87 Difference]: Start difference. First operand 192 states and 267 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:33,186 INFO L93 Difference]: Finished difference Result 199 states and 273 transitions. [2023-12-22 03:18:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-12-22 03:18:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:33,188 INFO L225 Difference]: With dead ends: 199 [2023-12-22 03:18:33,188 INFO L226 Difference]: Without dead ends: 192 [2023-12-22 03:18:33,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:33,189 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 5 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:33,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 362 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 03:18:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-22 03:18:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-12-22 03:18:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 166 states have (on average 1.3072289156626506) internal successors, (217), 169 states have internal predecessors, (217), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2023-12-22 03:18:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 264 transitions. [2023-12-22 03:18:33,195 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 264 transitions. Word has length 40 [2023-12-22 03:18:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:33,196 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 264 transitions. [2023-12-22 03:18:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 264 transitions. [2023-12-22 03:18:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 03:18:33,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:33,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:33,202 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 [2023-12-22 03:18:33,399 WARN L477 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 [2023-12-22 03:18:33,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:33,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1382908310, now seen corresponding path program 1 times [2023-12-22 03:18:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128616699] [2023-12-22 03:18:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:33,400 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 [2023-12-22 03:18:33,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:33,401 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) [2023-12-22 03:18:33,402 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 [2023-12-22 03:18:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:33,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:18:33,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:33,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:33,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128616699] [2023-12-22 03:18:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128616699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335244569] [2023-12-22 03:18:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:33,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:33,625 INFO L87 Difference]: Start difference. First operand 192 states and 264 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:33,896 INFO L93 Difference]: Finished difference Result 325 states and 457 transitions. [2023-12-22 03:18:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-12-22 03:18:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:33,897 INFO L225 Difference]: With dead ends: 325 [2023-12-22 03:18:33,897 INFO L226 Difference]: Without dead ends: 273 [2023-12-22 03:18:33,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:33,898 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:33,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 286 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 03:18:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-22 03:18:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 209. [2023-12-22 03:18:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 180 states have (on average 1.3166666666666667) internal successors, (237), 182 states have internal predecessors, (237), 24 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2023-12-22 03:18:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2023-12-22 03:18:33,909 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 41 [2023-12-22 03:18:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:33,910 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2023-12-22 03:18:33,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2023-12-22 03:18:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 03:18:33,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:33,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:33,916 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 (13)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:34,114 WARN L477 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 [2023-12-22 03:18:34,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:34,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -504265790, now seen corresponding path program 1 times [2023-12-22 03:18:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531426696] [2023-12-22 03:18:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:34,115 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 [2023-12-22 03:18:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:34,116 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) [2023-12-22 03:18:34,140 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 [2023-12-22 03:18:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:34,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 03:18:34,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 03:18:34,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:34,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531426696] [2023-12-22 03:18:34,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531426696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:34,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 03:18:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285233640] [2023-12-22 03:18:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:34,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:34,698 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:39,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-22 03:18:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:39,644 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2023-12-22 03:18:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-12-22 03:18:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:39,646 INFO L225 Difference]: With dead ends: 230 [2023-12-22 03:18:39,646 INFO L226 Difference]: Without dead ends: 228 [2023-12-22 03:18:39,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:18:39,647 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:39,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 436 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-22 03:18:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-22 03:18:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 213. [2023-12-22 03:18:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 185 states have internal predecessors, (240), 24 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2023-12-22 03:18:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 293 transitions. [2023-12-22 03:18:39,654 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 293 transitions. Word has length 41 [2023-12-22 03:18:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:39,654 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 293 transitions. [2023-12-22 03:18:39,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 293 transitions. [2023-12-22 03:18:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 03:18:39,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:39,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:39,672 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 [2023-12-22 03:18:39,860 WARN L477 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 [2023-12-22 03:18:39,860 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:39,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -447007488, now seen corresponding path program 1 times [2023-12-22 03:18:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353978248] [2023-12-22 03:18:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:39,861 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 [2023-12-22 03:18:39,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:39,863 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) [2023-12-22 03:18:39,863 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 [2023-12-22 03:18:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:39,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 03:18:39,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 03:18:40,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:40,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353978248] [2023-12-22 03:18:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353978248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:40,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 03:18:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735348627] [2023-12-22 03:18:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:40,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:40,383 INFO L87 Difference]: Start difference. First operand 213 states and 293 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:45,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-22 03:18:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:45,357 INFO L93 Difference]: Finished difference Result 219 states and 298 transitions. [2023-12-22 03:18:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:45,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-12-22 03:18:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:45,359 INFO L225 Difference]: With dead ends: 219 [2023-12-22 03:18:45,359 INFO L226 Difference]: Without dead ends: 217 [2023-12-22 03:18:45,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:18:45,360 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:45,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 416 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-22 03:18:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-22 03:18:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-12-22 03:18:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 186 states have (on average 1.3064516129032258) internal successors, (243), 188 states have internal predecessors, (243), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2023-12-22 03:18:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 296 transitions. [2023-12-22 03:18:45,368 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 296 transitions. Word has length 41 [2023-12-22 03:18:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:45,368 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 296 transitions. [2023-12-22 03:18:45,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 296 transitions. [2023-12-22 03:18:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-22 03:18:45,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:45,369 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2023-12-22 03:18:45,373 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 [2023-12-22 03:18:45,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 [2023-12-22 03:18:45,572 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:45,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1272516475, now seen corresponding path program 1 times [2023-12-22 03:18:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:45,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310403981] [2023-12-22 03:18:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:45,573 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 [2023-12-22 03:18:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:45,574 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-12-22 03:18:45,586 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 (16)] Waiting until timeout for monitored process [2023-12-22 03:18:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:45,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:18:45,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:45,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:45,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310403981] [2023-12-22 03:18:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310403981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:45,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129386092] [2023-12-22 03:18:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:45,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:45,731 INFO L87 Difference]: Start difference. First operand 217 states and 296 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:45,929 INFO L93 Difference]: Finished difference Result 232 states and 312 transitions. [2023-12-22 03:18:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 03:18:45,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-12-22 03:18:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:45,930 INFO L225 Difference]: With dead ends: 232 [2023-12-22 03:18:45,930 INFO L226 Difference]: Without dead ends: 195 [2023-12-22 03:18:45,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:45,931 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:45,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 03:18:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-22 03:18:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2023-12-22 03:18:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.3231707317073171) internal successors, (217), 167 states have internal predecessors, (217), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2023-12-22 03:18:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2023-12-22 03:18:45,939 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 44 [2023-12-22 03:18:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:45,939 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2023-12-22 03:18:45,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2023-12-22 03:18:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-22 03:18:45,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:45,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:45,944 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 (16)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:46,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:18:46,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:46,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1639908257, now seen corresponding path program 1 times [2023-12-22 03:18:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30361970] [2023-12-22 03:18:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:46,145 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 [2023-12-22 03:18:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:46,146 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) [2023-12-22 03:18:46,147 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 [2023-12-22 03:18:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:46,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 03:18:46,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 03:18:46,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:46,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30361970] [2023-12-22 03:18:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30361970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:18:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422494461] [2023-12-22 03:18:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:18:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:18:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:46,429 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:47,220 INFO L93 Difference]: Finished difference Result 255 states and 351 transitions. [2023-12-22 03:18:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 03:18:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-12-22 03:18:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:47,221 INFO L225 Difference]: With dead ends: 255 [2023-12-22 03:18:47,221 INFO L226 Difference]: Without dead ends: 215 [2023-12-22 03:18:47,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:18:47,222 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:47,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 363 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-22 03:18:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-22 03:18:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2023-12-22 03:18:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 167 states have internal predecessors, (215), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2023-12-22 03:18:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2023-12-22 03:18:47,230 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 45 [2023-12-22 03:18:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:47,231 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2023-12-22 03:18:47,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2023-12-22 03:18:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-22 03:18:47,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:47,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:47,236 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 [2023-12-22 03:18:47,434 WARN L477 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 [2023-12-22 03:18:47,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:47,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2032935267, now seen corresponding path program 1 times [2023-12-22 03:18:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379432561] [2023-12-22 03:18:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:47,436 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 [2023-12-22 03:18:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:47,436 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) [2023-12-22 03:18:47,438 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 [2023-12-22 03:18:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:47,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:18:47,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 03:18:47,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:47,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:47,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379432561] [2023-12-22 03:18:47,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379432561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:47,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:47,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450989905] [2023-12-22 03:18:47,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:47,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:47,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:47,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:47,629 INFO L87 Difference]: Start difference. First operand 195 states and 266 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:48,076 INFO L93 Difference]: Finished difference Result 275 states and 372 transitions. [2023-12-22 03:18:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:18:48,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-12-22 03:18:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:48,078 INFO L225 Difference]: With dead ends: 275 [2023-12-22 03:18:48,078 INFO L226 Difference]: Without dead ends: 246 [2023-12-22 03:18:48,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:48,079 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 59 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:48,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 235 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 03:18:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-22 03:18:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 199. [2023-12-22 03:18:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.3035714285714286) internal successors, (219), 171 states have internal predecessors, (219), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2023-12-22 03:18:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2023-12-22 03:18:48,089 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 45 [2023-12-22 03:18:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:48,089 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2023-12-22 03:18:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2023-12-22 03:18:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-22 03:18:48,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:48,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:48,095 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 [2023-12-22 03:18:48,292 WARN L477 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 [2023-12-22 03:18:48,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:48,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2146016054, now seen corresponding path program 1 times [2023-12-22 03:18:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:48,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243074487] [2023-12-22 03:18:48,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:48,294 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 [2023-12-22 03:18:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:48,295 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) [2023-12-22 03:18:48,295 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 [2023-12-22 03:18:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:48,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:18:48,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:48,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:48,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243074487] [2023-12-22 03:18:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243074487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:48,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 03:18:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235387132] [2023-12-22 03:18:48,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:48,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:18:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:48,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:18:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:18:48,735 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:50,290 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2023-12-22 03:18:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:18:50,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-12-22 03:18:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:50,292 INFO L225 Difference]: With dead ends: 275 [2023-12-22 03:18:50,292 INFO L226 Difference]: Without dead ends: 251 [2023-12-22 03:18:50,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:50,292 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 41 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:50,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 426 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-22 03:18:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-22 03:18:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 233. [2023-12-22 03:18:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.297979797979798) internal successors, (257), 202 states have internal predecessors, (257), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-22 03:18:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2023-12-22 03:18:50,305 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 46 [2023-12-22 03:18:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:50,306 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2023-12-22 03:18:50,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2023-12-22 03:18:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-22 03:18:50,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:50,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:50,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:50,509 WARN L477 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 [2023-12-22 03:18:50,509 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:50,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1015925832, now seen corresponding path program 1 times [2023-12-22 03:18:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618215652] [2023-12-22 03:18:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:50,510 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 [2023-12-22 03:18:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:50,511 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) [2023-12-22 03:18:50,514 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 [2023-12-22 03:18:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:50,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:18:50,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 03:18:50,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:18:50,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618215652] [2023-12-22 03:18:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618215652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:18:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:18:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:18:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565986033] [2023-12-22 03:18:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:18:50,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:18:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:18:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:18:50,786 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:51,032 INFO L93 Difference]: Finished difference Result 286 states and 380 transitions. [2023-12-22 03:18:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 03:18:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-12-22 03:18:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:51,033 INFO L225 Difference]: With dead ends: 286 [2023-12-22 03:18:51,033 INFO L226 Difference]: Without dead ends: 252 [2023-12-22 03:18:51,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:18:51,034 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 84 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:51,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 269 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 03:18:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-22 03:18:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2023-12-22 03:18:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.2373737373737375) internal successors, (245), 202 states have internal predecessors, (245), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-22 03:18:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2023-12-22 03:18:51,044 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 304 transitions. Word has length 46 [2023-12-22 03:18:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:51,044 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 304 transitions. [2023-12-22 03:18:51,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-22 03:18:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 304 transitions. [2023-12-22 03:18:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-22 03:18:51,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:51,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-22 03:18:51,063 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 (20)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:51,245 WARN L477 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 [2023-12-22 03:18:51,246 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:51,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1438627658, now seen corresponding path program 1 times [2023-12-22 03:18:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427973248] [2023-12-22 03:18:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:51,246 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 [2023-12-22 03:18:51,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:51,248 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) [2023-12-22 03:18:51,288 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 [2023-12-22 03:18:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:18:51,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 03:18:51,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:18:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:51,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:18:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 03:18:52,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:18:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427973248] [2023-12-22 03:18:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427973248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:18:52,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:18:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-22 03:18:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344755429] [2023-12-22 03:18:52,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:18:52,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:18:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:18:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:18:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:18:52,569 INFO L87 Difference]: Start difference. First operand 233 states and 304 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:18:53,352 INFO L93 Difference]: Finished difference Result 267 states and 343 transitions. [2023-12-22 03:18:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:18:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2023-12-22 03:18:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:18:53,353 INFO L225 Difference]: With dead ends: 267 [2023-12-22 03:18:53,353 INFO L226 Difference]: Without dead ends: 235 [2023-12-22 03:18:53,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-22 03:18:53,354 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 90 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-22 03:18:53,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 512 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-22 03:18:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-22 03:18:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 214. [2023-12-22 03:18:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 179 states have (on average 1.2402234636871508) internal successors, (222), 183 states have internal predecessors, (222), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2023-12-22 03:18:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2023-12-22 03:18:53,364 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 46 [2023-12-22 03:18:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:18:53,365 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2023-12-22 03:18:53,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 03:18:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2023-12-22 03:18:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-22 03:18:53,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:18:53,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2023-12-22 03:18:53,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:53,572 WARN L477 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 [2023-12-22 03:18:53,572 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:18:53,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:18:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1180898010, now seen corresponding path program 1 times [2023-12-22 03:18:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:18:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021473941] [2023-12-22 03:18:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:18:53,573 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 [2023-12-22 03:18:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:18:53,574 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) [2023-12-22 03:18:53,604 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 [2023-12-22 03:18:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 03:18:53,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-22 03:18:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 03:18:53,673 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-22 03:18:53,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-22 03:18:53,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 03:18:53,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 03:18:53,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-22 03:18:53,884 WARN L477 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 [2023-12-22 03:18:53,887 INFO L445 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] [2023-12-22 03:18:53,889 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 03:18:53,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:18:53 BoogieIcfgContainer [2023-12-22 03:18:53,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 03:18:53,939 INFO L158 Benchmark]: Toolchain (without parser) took 197165.93ms. Allocated memory is still 312.5MB. Free memory was 251.9MB in the beginning and 166.1MB in the end (delta: 85.8MB). Peak memory consumption was 87.4MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,939 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 206.6MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 03:18:53,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.01ms. Allocated memory is still 312.5MB. Free memory was 251.4MB in the beginning and 235.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 312.5MB. Free memory was 235.6MB in the beginning and 233.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,940 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 312.5MB. Free memory was 233.6MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,941 INFO L158 Benchmark]: RCFGBuilder took 4655.23ms. Allocated memory is still 312.5MB. Free memory was 230.4MB in the beginning and 208.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,941 INFO L158 Benchmark]: TraceAbstraction took 192191.04ms. Allocated memory is still 312.5MB. Free memory was 208.4MB in the beginning and 166.1MB in the end (delta: 42.3MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. [2023-12-22 03:18:53,943 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.42ms. Allocated memory is still 206.6MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.01ms. Allocated memory is still 312.5MB. Free memory was 251.4MB in the beginning and 235.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 312.5MB. Free memory was 235.6MB in the beginning and 233.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 312.5MB. Free memory was 233.6MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4655.23ms. Allocated memory is still 312.5MB. Free memory was 230.4MB in the beginning and 208.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 192191.04ms. Allocated memory is still 312.5MB. Free memory was 208.4MB in the beginning and 166.1MB in the end (delta: 42.3MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 60]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L402] COND FALSE !(__VERIFIER_nondet_int()) [L405] CALL main2() [L269] unsigned int a ; [L270] unsigned int ma = __VERIFIER_nondet_uint(); [L271] signed char ea = __VERIFIER_nondet_char(); [L272] unsigned int b ; [L273] unsigned int mb = __VERIFIER_nondet_uint(); [L274] signed char eb = __VERIFIER_nondet_char(); [L275] unsigned int r_add ; [L276] unsigned int zero ; [L277] int sa ; [L278] int sb ; [L279] int tmp ; [L280] int tmp___0 ; [L281] int tmp___1 ; [L282] int tmp___2 ; [L283] int tmp___3 ; [L284] int tmp___4 ; [L285] int tmp___5 ; [L286] int tmp___6 ; [L287] int tmp___7 ; [L288] int tmp___8 ; [L289] int tmp___9 ; [L290] int __retres23 ; [L294] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L72] COND TRUE ! m [L73] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L123] return (__retres4); [L294] RET, EXPR base2flt(0, 0) [L294] zero = base2flt(0, 0) [L295] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L123] return (__retres4); [L295] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216, zero=0] [L295] a = base2flt(ma, ea) [L296] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L123] return (__retres4); [L296] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L296] b = base2flt(mb, eb) [L298] COND FALSE !(a < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L301] COND TRUE a > zero [L302] tmp = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L306] sa = tmp VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L308] COND FALSE !(b < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L311] COND TRUE b > zero [L312] tmp___0 = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L316] sb = tmp___0 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L319] CALL addflt(a, b) [L127] unsigned int res ; [L128] unsigned int ma ; [L129] unsigned int mb ; [L130] unsigned int delta ; [L131] int ea ; [L132] int eb ; [L133] unsigned int tmp ; [L134] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L137] COND TRUE a < b [L138] tmp = a [L139] a = b [L140] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L144] COND FALSE !(! b) [L151] ma = a & ((1U << 24U) - 1U) [L152] ea = (int )(a >> 24U) - 128 [L153] ma = ma | (1U << 24U) [L154] mb = b & ((1U << 24U) - 1U) [L155] eb = (int )(b >> 24U) - 128 [L156] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L157] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L59] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L157] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L158] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L159] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L59] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L60] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 48]: 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, 75 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 192.1s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 987 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 7365 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 210 IncrementalHoareTripleChecker+Unchecked, 5387 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1256 IncrementalHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 1978 mSDtfsCounter, 1256 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 815 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 23.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=18, InterpolantAutomatonStates: 116, 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, 20 MinimizatonAttempts, 332 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 48.1s SatisfiabilityAnalysisTime, 104.9s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 890 ConstructedInterpolants, 4 QuantifiedInterpolants, 1662 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1441 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 266/292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-22 03:18:54,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...