/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:29:27,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:29:27,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:29:27,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:29:27,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:29:27,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:29:27,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:29:27,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:29:27,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:29:27,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:29:27,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:29:27,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:29:27,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:29:27,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:29:27,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:29:27,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:29:27,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:29:27,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:29:27,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:29:27,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:29:27,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:29:27,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:29:27,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:29:27,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:29:27,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:29:27,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:29:27,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:29:27,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:29:27,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:29:27,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:29:27,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:29:27,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:29:27,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:29:27,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:29:27,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:27,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:29:27,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:29:27,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:29:27,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:29:27,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:29:27,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:29:27,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:29:27,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:29:27,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:29:27,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:27,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:29:27,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:29:27,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:29:27,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:29:27,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:29:27,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2024-11-05 20:29:29,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:29:29,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:29:29,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2024-11-05 20:29:29,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1995f45f3/3120c51f7e7b45cf84b1594f29fef57a/FLAG4c05b0e8d [2024-11-05 20:29:29,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1995f45f3/3120c51f7e7b45cf84b1594f29fef57a [2024-11-05 20:29:29,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:29:29,743 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:29:29,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:29,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:29:29,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:29:29,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:29" (1/1) ... [2024-11-05 20:29:29,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c01060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:29, skipping insertion in model container [2024-11-05 20:29:29,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:29" (1/1) ... [2024-11-05 20:29:29,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:29:29,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2024-11-05 20:29:29,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:29,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:29:30,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2024-11-05 20:29:30,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:30,051 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:29:30,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30 WrapperNode [2024-11-05 20:29:30,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:30,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:30,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:29:30,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:29:30,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,087 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-05 20:29:30,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:30,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:29:30,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:29:30,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:29:30,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,117 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]. [2024-11-05 20:29:30,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:29:30,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:29:30,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:29:30,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:29:30,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (1/1) ... [2024-11-05 20:29:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:29:30,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:29:30,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:29:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:29:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:29:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-05 20:29:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-05 20:29:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:29:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:29:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 20:29:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 20:29:30,292 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:29:30,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:29:30,592 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-05 20:29:30,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:29:30,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:29:30,606 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 20:29:30,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:30 BoogieIcfgContainer [2024-11-05 20:29:30,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:29:30,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:29:30,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:29:30,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:29:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:29" (1/3) ... [2024-11-05 20:29:30,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325c1882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:30, skipping insertion in model container [2024-11-05 20:29:30,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:30" (2/3) ... [2024-11-05 20:29:30,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325c1882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:30, skipping insertion in model container [2024-11-05 20:29:30,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:30" (3/3) ... [2024-11-05 20:29:30,617 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2024-11-05 20:29:30,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:29:30,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:29:30,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:29:30,683 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a1cefc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:29:30,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:29:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 20:29:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 20:29:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:30,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:30,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1428146956, now seen corresponding path program 1 times [2024-11-05 20:29:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937118850] [2024-11-05 20:29:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:30,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:30,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 20:29:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:30,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:30,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:30,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:31,030 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937118850] [2024-11-05 20:29:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1937118850] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:31,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:31,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731007891] [2024-11-05 20:29:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:31,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:31,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:31,064 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:31,192 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-11-05 20:29:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:31,194 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-05 20:29:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:31,203 INFO L225 Difference]: With dead ends: 115 [2024-11-05 20:29:31,204 INFO L226 Difference]: Without dead ends: 60 [2024-11-05 20:29:31,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:31,210 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:31,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-05 20:29:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2024-11-05 20:29:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-05 20:29:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-05 20:29:31,258 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 42 [2024-11-05 20:29:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:31,259 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-05 20:29:31,259 INFO L472 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-05 20:29:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 20:29:31,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:31,262 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:31,267 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 [2024-11-05 20:29:31,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:31,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -649725496, now seen corresponding path program 1 times [2024-11-05 20:29:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777278998] [2024-11-05 20:29:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:31,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:31,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:31,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:31,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 (3)] Waiting until timeout for monitored process [2024-11-05 20:29:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:31,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:31,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:31,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:31,682 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777278998] [2024-11-05 20:29:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1777278998] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454276986] [2024-11-05 20:29:31,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:31,688 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:31,759 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2024-11-05 20:29:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-11-05 20:29:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:31,761 INFO L225 Difference]: With dead ends: 104 [2024-11-05 20:29:31,761 INFO L226 Difference]: Without dead ends: 60 [2024-11-05 20:29:31,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:31,763 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:31,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-05 20:29:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-05 20:29:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-05 20:29:31,776 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2024-11-05 20:29:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-05 20:29:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-05 20:29:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-05 20:29:31,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:31,778 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:31,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:29:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:31,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:31,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 996548609, now seen corresponding path program 1 times [2024-11-05 20:29:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129577222] [2024-11-05 20:29:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:31,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:31,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 20:29:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:32,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:32,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:32,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:32,171 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129577222] [2024-11-05 20:29:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1129577222] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102277651] [2024-11-05 20:29:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:32,175 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:32,255 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2024-11-05 20:29:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:32,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-05 20:29:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:32,257 INFO L225 Difference]: With dead ends: 116 [2024-11-05 20:29:32,257 INFO L226 Difference]: Without dead ends: 67 [2024-11-05 20:29:32,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:32,259 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:32,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-05 20:29:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2024-11-05 20:29:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2024-11-05 20:29:32,270 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 46 [2024-11-05 20:29:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:32,270 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2024-11-05 20:29:32,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2024-11-05 20:29:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-05 20:29:32,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:32,273 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:32,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 20:29:32,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:32,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1306691689, now seen corresponding path program 1 times [2024-11-05 20:29:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:32,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067728880] [2024-11-05 20:29:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:32,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:32,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:32,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:32,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:29:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:32,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:32,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:32,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:32,679 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067728880] [2024-11-05 20:29:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2067728880] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-05 20:29:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629533145] [2024-11-05 20:29:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:29:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:29:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:32,684 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:32,808 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2024-11-05 20:29:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:32,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-05 20:29:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:32,810 INFO L225 Difference]: With dead ends: 124 [2024-11-05 20:29:32,810 INFO L226 Difference]: Without dead ends: 74 [2024-11-05 20:29:32,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:32,812 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:32,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 220 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-05 20:29:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2024-11-05 20:29:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-11-05 20:29:32,820 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 47 [2024-11-05 20:29:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:32,820 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-11-05 20:29:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-11-05 20:29:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 20:29:32,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:32,822 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-05 20:29:32,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:33,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 164215198, now seen corresponding path program 1 times [2024-11-05 20:29:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [924138251] [2024-11-05 20:29:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:33,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:33,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:29:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:33,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:33,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:33,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:33,264 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [924138251] [2024-11-05 20:29:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [924138251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:33,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:29:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910020845] [2024-11-05 20:29:33,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:33,266 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:33,431 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2024-11-05 20:29:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:33,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-05 20:29:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:33,434 INFO L225 Difference]: With dead ends: 133 [2024-11-05 20:29:33,434 INFO L226 Difference]: Without dead ends: 82 [2024-11-05 20:29:33,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:33,438 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:33,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 367 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-05 20:29:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-11-05 20:29:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-11-05 20:29:33,454 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 48 [2024-11-05 20:29:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:33,454 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-11-05 20:29:33,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-11-05 20:29:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 20:29:33,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:33,455 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:33,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 (6)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:33,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:33,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650751, now seen corresponding path program 1 times [2024-11-05 20:29:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863917423] [2024-11-05 20:29:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:33,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:33,659 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 20:29:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:33,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:33,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:33,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:33,919 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863917423] [2024-11-05 20:29:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863917423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:33,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:29:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740540236] [2024-11-05 20:29:33,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:33,921 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:34,197 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2024-11-05 20:29:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:29:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-11-05 20:29:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:34,199 INFO L225 Difference]: With dead ends: 163 [2024-11-05 20:29:34,199 INFO L226 Difference]: Without dead ends: 104 [2024-11-05 20:29:34,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:29:34,203 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:34,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 332 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-05 20:29:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2024-11-05 20:29:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-11-05 20:29:34,215 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 50 [2024-11-05 20:29:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-11-05 20:29:34,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-11-05 20:29:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-05 20:29:34,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:34,217 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:34,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 20:29:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:34,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash -231695800, now seen corresponding path program 2 times [2024-11-05 20:29:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262881941] [2024-11-05 20:29:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:34,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:34,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 20:29:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:34,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:34,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:34,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:34,838 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262881941] [2024-11-05 20:29:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [262881941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:34,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-05 20:29:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918683993] [2024-11-05 20:29:34,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:29:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:29:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:34,840 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:35,286 INFO L93 Difference]: Finished difference Result 168 states and 244 transitions. [2024-11-05 20:29:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:29:35,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-05 20:29:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:35,289 INFO L225 Difference]: With dead ends: 168 [2024-11-05 20:29:35,289 INFO L226 Difference]: Without dead ends: 105 [2024-11-05 20:29:35,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:35,291 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:35,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 471 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-05 20:29:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2024-11-05 20:29:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-05 20:29:35,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 57 [2024-11-05 20:29:35,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:35,312 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-05 20:29:35,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-05 20:29:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-05 20:29:35,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:35,313 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:35,320 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 [2024-11-05 20:29:35,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:35,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash 932928063, now seen corresponding path program 2 times [2024-11-05 20:29:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137048581] [2024-11-05 20:29:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:35,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:35,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 20:29:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:35,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:29:35,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:35,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:36,033 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137048581] [2024-11-05 20:29:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2137048581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:36,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 20:29:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387412225] [2024-11-05 20:29:36,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:36,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 20:29:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 20:29:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:36,036 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:37,003 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2024-11-05 20:29:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 20:29:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-11-05 20:29:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:37,005 INFO L225 Difference]: With dead ends: 233 [2024-11-05 20:29:37,005 INFO L226 Difference]: Without dead ends: 156 [2024-11-05 20:29:37,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=605, Unknown=0, NotChecked=0, Total=930 [2024-11-05 20:29:37,007 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 199 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:37,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 792 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:29:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-05 20:29:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 94. [2024-11-05 20:29:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-05 20:29:37,022 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 62 [2024-11-05 20:29:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-05 20:29:37,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-05 20:29:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-05 20:29:37,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:37,024 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:37,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:37,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 467575560, now seen corresponding path program 3 times [2024-11-05 20:29:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [244968323] [2024-11-05 20:29:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:37,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:37,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:37,229 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:37,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 20:29:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:37,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 20:29:37,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:37,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:38,438 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:38,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [244968323] [2024-11-05 20:29:38,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [244968323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:38,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:38,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-05 20:29:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595375827] [2024-11-05 20:29:38,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:38,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 20:29:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 20:29:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-05 20:29:38,441 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:40,386 INFO L93 Difference]: Finished difference Result 240 states and 356 transitions. [2024-11-05 20:29:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-05 20:29:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-11-05 20:29:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:40,388 INFO L225 Difference]: With dead ends: 240 [2024-11-05 20:29:40,388 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 20:29:40,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=453, Invalid=807, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 20:29:40,390 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1194 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:29:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 20:29:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2024-11-05 20:29:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 112 states have internal predecessors, (171), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 184 transitions. [2024-11-05 20:29:40,414 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 184 transitions. Word has length 75 [2024-11-05 20:29:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 184 transitions. [2024-11-05 20:29:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 184 transitions. [2024-11-05 20:29:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 20:29:40,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:40,416 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:40,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:40,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:40,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1327823167, now seen corresponding path program 3 times [2024-11-05 20:29:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104286908] [2024-11-05 20:29:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:40,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:40,619 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:40,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 20:29:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:40,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 20:29:40,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:40,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:41,851 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104286908] [2024-11-05 20:29:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1104286908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:41,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-05 20:29:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721307857] [2024-11-05 20:29:41,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-05 20:29:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-05 20:29:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-05 20:29:41,854 INFO L87 Difference]: Start difference. First operand 120 states and 184 transitions. Second operand has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:43,957 INFO L93 Difference]: Finished difference Result 337 states and 499 transitions. [2024-11-05 20:29:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-05 20:29:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-11-05 20:29:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:43,961 INFO L225 Difference]: With dead ends: 337 [2024-11-05 20:29:43,961 INFO L226 Difference]: Without dead ends: 224 [2024-11-05 20:29:43,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=936, Invalid=2256, Unknown=0, NotChecked=0, Total=3192 [2024-11-05 20:29:43,963 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 559 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:43,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1694 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 20:29:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-05 20:29:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 124. [2024-11-05 20:29:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 115 states have (on average 1.5478260869565217) internal successors, (178), 116 states have internal predecessors, (178), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 191 transitions. [2024-11-05 20:29:43,991 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 191 transitions. Word has length 86 [2024-11-05 20:29:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:43,991 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 191 transitions. [2024-11-05 20:29:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 191 transitions. [2024-11-05 20:29:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-05 20:29:43,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:43,993 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:43,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-05 20:29:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:44,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:44,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876744, now seen corresponding path program 4 times [2024-11-05 20:29:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007134230] [2024-11-05 20:29:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:44,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:44,199 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 20:29:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:44,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 20:29:44,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:29:44,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 20:29:46,862 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007134230] [2024-11-05 20:29:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2007134230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:46,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:46,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-05 20:29:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846098236] [2024-11-05 20:29:46,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:46,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-05 20:29:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:46,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-05 20:29:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2024-11-05 20:29:46,865 INFO L87 Difference]: Start difference. First operand 124 states and 191 transitions. Second operand has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:54,362 INFO L93 Difference]: Finished difference Result 366 states and 550 transitions. [2024-11-05 20:29:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-05 20:29:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2024-11-05 20:29:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:54,364 INFO L225 Difference]: With dead ends: 366 [2024-11-05 20:29:54,364 INFO L226 Difference]: Without dead ends: 249 [2024-11-05 20:29:54,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1773, Invalid=3339, Unknown=0, NotChecked=0, Total=5112 [2024-11-05 20:29:54,367 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 689 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 3161 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:54,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 3161 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 20:29:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-05 20:29:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 192. [2024-11-05 20:29:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 183 states have (on average 1.5901639344262295) internal successors, (291), 184 states have internal predecessors, (291), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 304 transitions. [2024-11-05 20:29:54,385 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 304 transitions. Word has length 111 [2024-11-05 20:29:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 304 transitions. [2024-11-05 20:29:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:29:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 304 transitions. [2024-11-05 20:29:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 20:29:54,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:54,387 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:54,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-05 20:29:54,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:54,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:54,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2132035585, now seen corresponding path program 4 times [2024-11-05 20:29:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:54,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791306991] [2024-11-05 20:29:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:54,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:54,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:54,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:54,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 20:29:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:54,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:54,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:54,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:54,740 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791306991] [2024-11-05 20:29:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [791306991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:54,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-05 20:29:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765352499] [2024-11-05 20:29:54,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:54,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:54,742 INFO L87 Difference]: Start difference. First operand 192 states and 304 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:54,781 INFO L93 Difference]: Finished difference Result 218 states and 341 transitions. [2024-11-05 20:29:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:54,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-11-05 20:29:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:54,783 INFO L225 Difference]: With dead ends: 218 [2024-11-05 20:29:54,783 INFO L226 Difference]: Without dead ends: 198 [2024-11-05 20:29:54,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:54,784 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:54,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 245 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-05 20:29:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2024-11-05 20:29:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 183 states have (on average 1.5792349726775956) internal successors, (289), 184 states have internal predecessors, (289), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:29:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 302 transitions. [2024-11-05 20:29:54,799 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 302 transitions. Word has length 116 [2024-11-05 20:29:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 302 transitions. [2024-11-05 20:29:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 302 transitions. [2024-11-05 20:29:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-05 20:29:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:54,800 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-05 20:29:54,807 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 [2024-11-05 20:29:55,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:55,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:55,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1061161631, now seen corresponding path program 1 times [2024-11-05 20:29:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:55,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999393321] [2024-11-05 20:29:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:55,003 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:55,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 20:29:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:55,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:55,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:55,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:55,118 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999393321] [2024-11-05 20:29:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1999393321] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:55,118 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2024-11-05 20:29:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264181157] [2024-11-05 20:29:55,118 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:55,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:55,120 INFO L87 Difference]: Start difference. First operand 192 states and 302 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:55,195 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2024-11-05 20:29:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-05 20:29:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:55,200 INFO L225 Difference]: With dead ends: 224 [2024-11-05 20:29:55,201 INFO L226 Difference]: Without dead ends: 203 [2024-11-05 20:29:55,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:55,201 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:55,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-05 20:29:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-11-05 20:29:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 190 states have (on average 1.5578947368421052) internal successors, (296), 192 states have internal predecessors, (296), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-05 20:29:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 314 transitions. [2024-11-05 20:29:55,244 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 314 transitions. Word has length 120 [2024-11-05 20:29:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:55,244 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 314 transitions. [2024-11-05 20:29:55,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 314 transitions. [2024-11-05 20:29:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-05 20:29:55,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:55,245 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-05 20:29:55,254 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 (14)] Ended with exit code 0 [2024-11-05 20:29:55,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:55,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -218702047, now seen corresponding path program 1 times [2024-11-05 20:29:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1662305311] [2024-11-05 20:29:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:55,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:55,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:55,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:55,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 20:29:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:55,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:55,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:55,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-05 20:29:55,589 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:55,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1662305311] [2024-11-05 20:29:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1662305311] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:55,590 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 20:29:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416283248] [2024-11-05 20:29:55,590 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:29:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:29:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:55,591 INFO L87 Difference]: Start difference. First operand 201 states and 314 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:55,642 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-05 20:29:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:29:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-05 20:29:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:55,644 INFO L225 Difference]: With dead ends: 223 [2024-11-05 20:29:55,644 INFO L226 Difference]: Without dead ends: 205 [2024-11-05 20:29:55,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:55,645 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:55,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-05 20:29:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-05 20:29:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 196 states have internal predecessors, (300), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-05 20:29:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 318 transitions. [2024-11-05 20:29:55,664 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 318 transitions. Word has length 120 [2024-11-05 20:29:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:55,664 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 318 transitions. [2024-11-05 20:29:55,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 318 transitions. [2024-11-05 20:29:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-05 20:29:55,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:55,665 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-05 20:29:55,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-05 20:29:55,866 WARN L453 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 [2024-11-05 20:29:55,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:55,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash 39463391, now seen corresponding path program 1 times [2024-11-05 20:29:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1714934849] [2024-11-05 20:29:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:55,868 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) [2024-11-05 20:29:55,869 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 [2024-11-05 20:29:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:55,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:55,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-05 20:29:55,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-05 20:29:55,991 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1714934849] [2024-11-05 20:29:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1714934849] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:55,992 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 20:29:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854369064] [2024-11-05 20:29:55,992 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:29:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:29:55,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:29:55,994 INFO L87 Difference]: Start difference. First operand 205 states and 318 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:56,030 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2024-11-05 20:29:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-05 20:29:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:56,032 INFO L225 Difference]: With dead ends: 216 [2024-11-05 20:29:56,032 INFO L226 Difference]: Without dead ends: 210 [2024-11-05 20:29:56,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:29:56,033 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:56,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-05 20:29:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-05 20:29:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 199 states have (on average 1.5326633165829147) internal successors, (305), 201 states have internal predecessors, (305), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-05 20:29:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 323 transitions. [2024-11-05 20:29:56,049 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 323 transitions. Word has length 120 [2024-11-05 20:29:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 323 transitions. [2024-11-05 20:29:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 323 transitions. [2024-11-05 20:29:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-05 20:29:56,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:56,050 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-05 20:29:56,055 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 (16)] Ended with exit code 0 [2024-11-05 20:29:56,254 WARN L453 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 [2024-11-05 20:29:56,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash 96721693, now seen corresponding path program 1 times [2024-11-05 20:29:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266955940] [2024-11-05 20:29:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:56,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:56,256 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:56,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-05 20:29:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:56,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:56,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-05 20:29:56,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-05 20:29:56,390 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266955940] [2024-11-05 20:29:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [266955940] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:56,390 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 20:29:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022793786] [2024-11-05 20:29:56,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:56,392 INFO L87 Difference]: Start difference. First operand 210 states and 323 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:56,429 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2024-11-05 20:29:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-05 20:29:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:56,431 INFO L225 Difference]: With dead ends: 216 [2024-11-05 20:29:56,431 INFO L226 Difference]: Without dead ends: 198 [2024-11-05 20:29:56,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:56,432 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:56,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 419 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-05 20:29:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-05 20:29:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 187 states have (on average 1.5508021390374331) internal successors, (290), 190 states have internal predecessors, (290), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-05 20:29:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 305 transitions. [2024-11-05 20:29:56,451 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 305 transitions. Word has length 120 [2024-11-05 20:29:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:56,451 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 305 transitions. [2024-11-05 20:29:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 305 transitions. [2024-11-05 20:29:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 20:29:56,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:56,453 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:56,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 (17)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:56,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:56,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1060052227, now seen corresponding path program 1 times [2024-11-05 20:29:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1542991910] [2024-11-05 20:29:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:56,658 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:56,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-05 20:29:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:56,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:29:56,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2024-11-05 20:29:56,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2024-11-05 20:29:56,813 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1542991910] [2024-11-05 20:29:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1542991910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:56,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-05 20:29:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740127983] [2024-11-05 20:29:56,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:56,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:56,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:56,816 INFO L87 Difference]: Start difference. First operand 198 states and 305 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:56,881 INFO L93 Difference]: Finished difference Result 225 states and 339 transitions. [2024-11-05 20:29:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 20:29:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2024-11-05 20:29:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:56,883 INFO L225 Difference]: With dead ends: 225 [2024-11-05 20:29:56,883 INFO L226 Difference]: Without dead ends: 195 [2024-11-05 20:29:56,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:56,884 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:56,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 381 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-05 20:29:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-05 20:29:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 20:29:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 254 transitions. [2024-11-05 20:29:56,900 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 254 transitions. Word has length 125 [2024-11-05 20:29:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 254 transitions. [2024-11-05 20:29:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 20:29:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 254 transitions. [2024-11-05 20:29:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-05 20:29:56,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:56,901 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:56,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:57,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1168378424, now seen corresponding path program 2 times [2024-11-05 20:29:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499438963] [2024-11-05 20:29:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:57,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:57,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:57,108 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:57,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-05 20:29:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:57,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:57,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-11-05 20:29:57,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-11-05 20:29:57,233 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499438963] [2024-11-05 20:29:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1499438963] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:57,233 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:29:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462311003] [2024-11-05 20:29:57,233 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:57,235 INFO L87 Difference]: Start difference. First operand 195 states and 254 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:57,255 INFO L93 Difference]: Finished difference Result 216 states and 279 transitions. [2024-11-05 20:29:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-05 20:29:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:57,256 INFO L225 Difference]: With dead ends: 216 [2024-11-05 20:29:57,256 INFO L226 Difference]: Without dead ends: 195 [2024-11-05 20:29:57,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:57,257 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:57,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-05 20:29:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-05 20:29:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 187 states have internal predecessors, (241), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 20:29:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2024-11-05 20:29:57,272 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 129 [2024-11-05 20:29:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:57,272 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2024-11-05 20:29:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2024-11-05 20:29:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-05 20:29:57,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:57,274 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:57,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-05 20:29:57,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:57,474 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 147310070, now seen corresponding path program 1 times [2024-11-05 20:29:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825779544] [2024-11-05 20:29:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:57,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:57,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:57,476 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:29:57,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-05 20:29:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:57,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 20:29:57,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-11-05 20:29:57,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-11-05 20:29:58,166 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825779544] [2024-11-05 20:29:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [825779544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:58,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2024-11-05 20:29:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894410029] [2024-11-05 20:29:58,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:58,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:29:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:29:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:29:58,168 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 20:29:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:58,313 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2024-11-05 20:29:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 129 [2024-11-05 20:29:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:58,316 INFO L225 Difference]: With dead ends: 196 [2024-11-05 20:29:58,316 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:29:58,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:58,317 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:58,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:29:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:29:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:29:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:29:58,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2024-11-05 20:29:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:58,319 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:29:58,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 20:29:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:29:58,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:29:58,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:29:58,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-05 20:29:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:58,529 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:58,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:29:59,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:29:59,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:29:59 BoogieIcfgContainer [2024-11-05 20:29:59,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:29:59,422 INFO L158 Benchmark]: Toolchain (without parser) took 29678.84ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 210.2MB in the beginning and 112.2MB in the end (delta: 98.0MB). Peak memory consumption was 162.7MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,423 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:29:59,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.57ms. Allocated memory is still 256.9MB. Free memory was 210.2MB in the beginning and 194.4MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.35ms. Allocated memory is still 256.9MB. Free memory was 194.4MB in the beginning and 192.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,423 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 256.9MB. Free memory was 192.7MB in the beginning and 190.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,424 INFO L158 Benchmark]: RCFGBuilder took 470.16ms. Allocated memory is still 256.9MB. Free memory was 190.3MB in the beginning and 173.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,424 INFO L158 Benchmark]: TraceAbstraction took 28812.37ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 172.4MB in the beginning and 112.2MB in the end (delta: 60.2MB). Peak memory consumption was 125.0MB. Max. memory is 8.0GB. [2024-11-05 20:29:59,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.57ms. Allocated memory is still 256.9MB. Free memory was 210.2MB in the beginning and 194.4MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.35ms. Allocated memory is still 256.9MB. Free memory was 194.4MB in the beginning and 192.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 256.9MB. Free memory was 192.7MB in the beginning and 190.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.16ms. Allocated memory is still 256.9MB. Free memory was 190.3MB in the beginning and 173.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 28812.37ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 172.4MB in the beginning and 112.2MB in the end (delta: 60.2MB). Peak memory consumption was 125.0MB. 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 19, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1903 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1903 mSDsluCounter, 11163 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9882 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6250 IncrementalHoareTripleChecker+Invalid, 6408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1281 mSDtfsCounter, 6250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3363 GetRequests, 3068 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=15, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 370 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1648 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3258 ConstructedInterpolants, 15 QuantifiedInterpolants, 8253 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2974 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 14294/16906 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((0 != \old(m)) && ((1 != \old(m)) || (m < 16777216))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((0 != \old(e)) || !(((e + -22) % 4294967296) <= -128)) && ((0 != \old(e)) || !(e <= -128))) && !(\old(m) < 16777216)) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Ensures: ((0 != m) || (0 == \result)) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 == cond) Ensures: (1 == cond) RESULT: Ultimate proved your program to be correct! [2024-11-05 20:29:59,460 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...