/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_3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:29:24,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:29:24,435 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:24,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:29:24,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:29:24,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:29:24,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:29:24,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:29:24,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:29:24,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:29:24,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:29:24,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:29:24,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:29:24,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:29:24,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:29:24,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:29:24,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:29:24,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:29:24,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:29:24,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:29:24,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:29:24,464 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:29:24,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:29:24,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:29:24,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:29:24,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:29:24,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:29:24,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:29:24,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:29:24,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:24,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:29:24,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:29:24,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:29:24,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:29:24,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:29:24,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:29:24,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:29:24,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:29:24,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:29:24,468 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:24,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:29:24,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:29:24,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:29:24,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:29:24,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:29:24,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2024-11-05 20:29:26,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:29:26,333 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:29:26,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2024-11-05 20:29:26,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3542021ca/818b0feeb64d4d11884c77b9497cea8f/FLAG4b8fea807 [2024-11-05 20:29:26,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3542021ca/818b0feeb64d4d11884c77b9497cea8f [2024-11-05 20:29:26,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:29:26,360 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:29:26,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:26,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:29:26,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:29:26,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:26" (1/1) ... [2024-11-05 20:29:26,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:26, skipping insertion in model container [2024-11-05 20:29:26,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:26" (1/1) ... [2024-11-05 20:29:26,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:29:26,758 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_3a.c.cil.c[728,741] [2024-11-05 20:29:26,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:26,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:29:26,878 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_3a.c.cil.c[728,741] [2024-11-05 20:29:26,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:26,959 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:29:26,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:26 WrapperNode [2024-11-05 20:29:26,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:26,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:26,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:29:26,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:29:26,973 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:26" (1/1) ... [2024-11-05 20:29:26,986 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:26" (1/1) ... [2024-11-05 20:29:27,016 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-05 20:29:27,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:27,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:29:27,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:29:27,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:29:27,031 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:26" (1/1) ... [2024-11-05 20:29:27,032 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:26" (1/1) ... [2024-11-05 20:29:27,041 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:26" (1/1) ... [2024-11-05 20:29:27,063 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:27,064 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:26" (1/1) ... [2024-11-05 20:29:27,064 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:26" (1/1) ... [2024-11-05 20:29:27,073 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:26" (1/1) ... [2024-11-05 20:29:27,075 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:26" (1/1) ... [2024-11-05 20:29:27,081 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:26" (1/1) ... [2024-11-05 20:29:27,082 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:26" (1/1) ... [2024-11-05 20:29:27,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:29:27,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:29:27,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:29:27,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:29:27,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:26" (1/1) ... [2024-11-05 20:29:27,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:29:27,130 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:27,142 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:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:29:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:29:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-05 20:29:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-05 20:29:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:29:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:29:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 20:29:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 20:29:27,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:29:27,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:29:27,492 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-05 20:29:27,492 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:29:27,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:29:27,501 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 20:29:27,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:27 BoogieIcfgContainer [2024-11-05 20:29:27,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:29:27,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:29:27,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:29:27,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:29:27,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:26" (1/3) ... [2024-11-05 20:29:27,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:27, skipping insertion in model container [2024-11-05 20:29:27,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:26" (2/3) ... [2024-11-05 20:29:27,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:27, skipping insertion in model container [2024-11-05 20:29:27,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:27" (3/3) ... [2024-11-05 20:29:27,508 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2024-11-05 20:29:27,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:29:27,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:29:27,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:29:27,577 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;@4cfb0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:29:27,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:29:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 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:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 20:29:27,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:27,587 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] [2024-11-05 20:29:27,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:27,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1696138713, now seen corresponding path program 1 times [2024-11-05 20:29:27,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:27,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755309548] [2024-11-05 20:29:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:27,600 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:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:27,605 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:27,617 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:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:27,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:27,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:27,760 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:27,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:27,859 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:27,860 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755309548] [2024-11-05 20:29:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1755309548] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936571898] [2024-11-05 20:29:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:27,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:27,893 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 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.0) internal successors, (28), 4 states have internal predecessors, (28), 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:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:28,019 INFO L93 Difference]: Finished difference Result 113 states and 179 transitions. [2024-11-05 20:29:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:28,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2024-11-05 20:29:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:28,027 INFO L225 Difference]: With dead ends: 113 [2024-11-05 20:29:28,027 INFO L226 Difference]: Without dead ends: 59 [2024-11-05 20:29:28,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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:28,031 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 163 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:28,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 163 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:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-05 20:29:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2024-11-05 20:29:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 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:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-11-05 20:29:28,060 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 41 [2024-11-05 20:29:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:28,060 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-11-05 20:29:28,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-11-05 20:29:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:28,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:28,062 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] [2024-11-05 20:29:28,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:29:28,265 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:28,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:28,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1421820539, now seen corresponding path program 1 times [2024-11-05 20:29:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396290472] [2024-11-05 20:29:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:28,267 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:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:28,270 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:28,271 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:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:28,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:28,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:28,337 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:28,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:28,412 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:28,412 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:28,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396290472] [2024-11-05 20:29:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396290472] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38177495] [2024-11-05 20:29:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:28,417 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (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:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:28,478 INFO L93 Difference]: Finished difference Result 102 states and 145 transitions. [2024-11-05 20:29:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (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 44 [2024-11-05 20:29:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:28,480 INFO L225 Difference]: With dead ends: 102 [2024-11-05 20:29:28,480 INFO L226 Difference]: Without dead ends: 59 [2024-11-05 20:29:28,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:28,481 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 157 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.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:28,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-05 20:29:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-05 20:29:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 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:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2024-11-05 20:29:28,495 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 44 [2024-11-05 20:29:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:28,495 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2024-11-05 20:29:28,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (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:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-05 20:29:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 20:29:28,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:28,496 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:28,500 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:28,697 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:28,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash -865634876, now seen corresponding path program 1 times [2024-11-05 20:29:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763223033] [2024-11-05 20:29:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:28,699 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:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:28,701 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:28,702 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:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:28,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:28,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:28,771 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:28,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:28,824 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:28,824 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763223033] [2024-11-05 20:29:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763223033] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:28,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:28,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-05 20:29:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873882007] [2024-11-05 20:29:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:28,826 INFO L87 Difference]: Start difference. First operand 55 states and 77 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:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:28,895 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2024-11-05 20:29:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:28,895 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:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:28,898 INFO L225 Difference]: With dead ends: 114 [2024-11-05 20:29:28,898 INFO L226 Difference]: Without dead ends: 66 [2024-11-05 20:29:28,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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:28,899 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 162 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:28,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 162 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:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-05 20:29:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2024-11-05 20:29:28,908 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:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-05 20:29:28,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2024-11-05 20:29:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-05 20:29:28,910 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:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-05 20:29:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-05 20:29:28,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:28,911 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:28,916 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:29,113 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:29,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 155611130, now seen corresponding path program 1 times [2024-11-05 20:29:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344031393] [2024-11-05 20:29:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:29,119 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:29,120 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:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:29,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:29,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:29,222 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:29,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:29,320 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:29,320 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344031393] [2024-11-05 20:29:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [344031393] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:29,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-05 20:29:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995558494] [2024-11-05 20:29:29,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:29,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:29:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:29:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:29,322 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:29,493 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2024-11-05 20:29:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:29,495 INFO L225 Difference]: With dead ends: 122 [2024-11-05 20:29:29,495 INFO L226 Difference]: Without dead ends: 73 [2024-11-05 20:29:29,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 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:29,496 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 216 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.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:29,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 216 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-05 20:29:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2024-11-05 20:29:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 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:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2024-11-05 20:29:29,503 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 46 [2024-11-05 20:29:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2024-11-05 20:29:29,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-11-05 20:29:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-05 20:29:29,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:29,504 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] [2024-11-05 20:29:29,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:29:29,706 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:29,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 709732423, now seen corresponding path program 1 times [2024-11-05 20:29:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800824154] [2024-11-05 20:29:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:29,708 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:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:29,711 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:29,713 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:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:29,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:29,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:29,803 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:29,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:29,877 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:29,877 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800824154] [2024-11-05 20:29:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [800824154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:29,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:29:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292280185] [2024-11-05 20:29:29,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:29,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:29,879 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:29,971 INFO L93 Difference]: Finished difference Result 131 states and 187 transitions. [2024-11-05 20:29:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 47 [2024-11-05 20:29:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:29,972 INFO L225 Difference]: With dead ends: 131 [2024-11-05 20:29:29,972 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 20:29:29,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:29,974 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:29,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 242 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 20:29:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2024-11-05 20:29:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 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:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-05 20:29:29,980 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 47 [2024-11-05 20:29:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:29,980 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-05 20:29:29,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-05 20:29:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-05 20:29:29,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:29,981 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] [2024-11-05 20:29:29,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 20:29:30,186 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:30,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1261268282, now seen corresponding path program 1 times [2024-11-05 20:29:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943348424] [2024-11-05 20:29:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:30,187 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,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:30,189 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:30,190 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:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:30,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:30,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:30,312 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:30,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:30,412 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:30,413 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943348424] [2024-11-05 20:29:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1943348424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:30,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:29:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387815338] [2024-11-05 20:29:30,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:30,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:30,414 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:30,658 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2024-11-05 20:29:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:29:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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 49 [2024-11-05 20:29:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:30,659 INFO L225 Difference]: With dead ends: 161 [2024-11-05 20:29:30,659 INFO L226 Difference]: Without dead ends: 103 [2024-11-05 20:29:30,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 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:30,661 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:30,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 366 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-05 20:29:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2024-11-05 20:29:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 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:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-11-05 20:29:30,670 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 49 [2024-11-05 20:29:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:30,670 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-11-05 20:29:30,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-11-05 20:29:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-05 20:29:30,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:30,671 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] [2024-11-05 20:29:30,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:30,871 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:30,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:30,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 243604347, now seen corresponding path program 2 times [2024-11-05 20:29:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:30,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419407327] [2024-11-05 20:29:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:30,873 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,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:30,874 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:30,876 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:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:30,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:30,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:31,000 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:31,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:31,210 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:31,211 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:31,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419407327] [2024-11-05 20:29:31,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1419407327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:31,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:31,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-05 20:29:31,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417110337] [2024-11-05 20:29:31,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:31,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:29:31,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:31,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:29:31,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:31,212 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:31,572 INFO L93 Difference]: Finished difference Result 166 states and 242 transitions. [2024-11-05 20:29:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:29:31,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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 56 [2024-11-05 20:29:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:31,574 INFO L225 Difference]: With dead ends: 166 [2024-11-05 20:29:31,574 INFO L226 Difference]: Without dead ends: 104 [2024-11-05 20:29:31,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 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:31,575 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 60 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:31,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 447 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-05 20:29:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2024-11-05 20:29:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 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,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-11-05 20:29:31,583 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 56 [2024-11-05 20:29:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:31,584 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-11-05 20:29:31,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-11-05 20:29:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-05 20:29:31,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:31,585 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] [2024-11-05 20:29:31,591 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:31,787 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:31,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1714660922, now seen corresponding path program 2 times [2024-11-05 20:29:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1967466441] [2024-11-05 20:29:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:31,789 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,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:31,796 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:31,801 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:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:31,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:29:31,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:31,939 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:31,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:32,217 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:32,217 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1967466441] [2024-11-05 20:29:32,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1967466441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:32,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 20:29:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978694909] [2024-11-05 20:29:32,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:32,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 20:29:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 20:29:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:32,219 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:32,986 INFO L93 Difference]: Finished difference Result 231 states and 341 transitions. [2024-11-05 20:29:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 20:29:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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 61 [2024-11-05 20:29:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:32,990 INFO L225 Difference]: With dead ends: 231 [2024-11-05 20:29:32,990 INFO L226 Difference]: Without dead ends: 155 [2024-11-05 20:29:32,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=605, Unknown=0, NotChecked=0, Total=930 [2024-11-05 20:29:32,991 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 263 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:32,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 730 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:29:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-05 20:29:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2024-11-05 20:29:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 85 states have internal predecessors, (127), 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,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2024-11-05 20:29:33,017 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 61 [2024-11-05 20:29:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:33,017 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2024-11-05 20:29:33,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 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,018 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2024-11-05 20:29:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 20:29:33,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:33,019 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] [2024-11-05 20:29:33,027 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 (9)] Ended with exit code 0 [2024-11-05 20:29:33,219 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:33,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:33,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash -907636485, now seen corresponding path program 3 times [2024-11-05 20:29:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151725265] [2024-11-05 20:29:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:33,221 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,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:33,223 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:33,225 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:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:33,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 20:29:33,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:33,511 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:33,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:34,061 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:34,061 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151725265] [2024-11-05 20:29:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [151725265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:34,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-05 20:29:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159161004] [2024-11-05 20:29:34,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:34,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 20:29:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 20:29:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-05 20:29:34,063 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:35,379 INFO L93 Difference]: Finished difference Result 238 states and 354 transitions. [2024-11-05 20:29:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-05 20:29:35,379 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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 74 [2024-11-05 20:29:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:35,380 INFO L225 Difference]: With dead ends: 238 [2024-11-05 20:29:35,380 INFO L226 Difference]: Without dead ends: 152 [2024-11-05 20:29:35,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=453, Invalid=807, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 20:29:35,381 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:35,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1140 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:29:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-05 20:29:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 119. [2024-11-05 20:29:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.5454545454545454) internal successors, (170), 111 states have internal predecessors, (170), 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,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 183 transitions. [2024-11-05 20:29:35,400 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 183 transitions. Word has length 74 [2024-11-05 20:29:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:35,400 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 183 transitions. [2024-11-05 20:29:35,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 183 transitions. [2024-11-05 20:29:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-05 20:29:35,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:35,401 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] [2024-11-05 20:29:35,407 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:35,604 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:35,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 19425222, now seen corresponding path program 3 times [2024-11-05 20:29:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913694543] [2024-11-05 20:29:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:35,606 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,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:35,608 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:35,609 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:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:35,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 20:29:35,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:35,923 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:35,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:36,685 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:36,685 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913694543] [2024-11-05 20:29:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [913694543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:36,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-05 20:29:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94057167] [2024-11-05 20:29:36,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:36,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-05 20:29:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-05 20:29:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-05 20:29:36,688 INFO L87 Difference]: Start difference. First operand 119 states and 183 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 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:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:38,610 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2024-11-05 20:29:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-05 20:29:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 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 85 [2024-11-05 20:29:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:38,612 INFO L225 Difference]: With dead ends: 335 [2024-11-05 20:29:38,612 INFO L226 Difference]: Without dead ends: 223 [2024-11-05 20:29:38,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=936, Invalid=2256, Unknown=0, NotChecked=0, Total=3192 [2024-11-05 20:29:38,614 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 704 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:38,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1586 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-05 20:29:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-05 20:29:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2024-11-05 20:29:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 114 states have (on average 1.5526315789473684) internal successors, (177), 115 states have internal predecessors, (177), 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:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-05 20:29:38,628 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 85 [2024-11-05 20:29:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-05 20:29:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 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:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-05 20:29:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-05 20:29:38,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:38,630 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] [2024-11-05 20:29:38,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:38,833 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:38,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1767529467, now seen corresponding path program 4 times [2024-11-05 20:29:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726227480] [2024-11-05 20:29:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:38,833 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:38,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:38,835 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:38,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 20:29:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:38,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 20:29:38,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:39,416 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:39,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:41,325 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:41,326 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726227480] [2024-11-05 20:29:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [726227480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:41,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-05 20:29:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496713628] [2024-11-05 20:29:41,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-05 20:29:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-05 20:29:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2024-11-05 20:29:41,328 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 50 states, 50 states have (on average 3.4) internal successors, (170), 50 states have internal predecessors, (170), 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:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:49,103 INFO L93 Difference]: Finished difference Result 364 states and 548 transitions. [2024-11-05 20:29:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-05 20:29:49,107 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.4) internal successors, (170), 50 states have internal predecessors, (170), 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 110 [2024-11-05 20:29:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:49,109 INFO L225 Difference]: With dead ends: 364 [2024-11-05 20:29:49,109 INFO L226 Difference]: Without dead ends: 248 [2024-11-05 20:29:49,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1773, Invalid=3339, Unknown=0, NotChecked=0, Total=5112 [2024-11-05 20:29:49,110 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 800 mSDsluCounter, 2933 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:49,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 3057 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-05 20:29:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-05 20:29:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2024-11-05 20:29:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 183 states have internal predecessors, (290), 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:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2024-11-05 20:29:49,124 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 110 [2024-11-05 20:29:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2024-11-05 20:29:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.4) internal successors, (170), 50 states have internal predecessors, (170), 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:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2024-11-05 20:29:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-05 20:29:49,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:49,126 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] [2024-11-05 20:29:49,130 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 (12)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:49,326 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:49,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:49,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash -861181626, now seen corresponding path program 4 times [2024-11-05 20:29:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:49,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1968161749] [2024-11-05 20:29:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:49,327 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:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:49,330 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:49,331 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:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:49,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:49,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:49,412 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:49,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:49,444 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:49,445 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1968161749] [2024-11-05 20:29:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1968161749] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:49,445 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2024-11-05 20:29:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33893004] [2024-11-05 20:29:49,445 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:49,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:49,446 INFO L87 Difference]: Start difference. First operand 191 states and 303 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:49,480 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2024-11-05 20:29:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:49,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 115 [2024-11-05 20:29:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:49,481 INFO L225 Difference]: With dead ends: 221 [2024-11-05 20:29:49,481 INFO L226 Difference]: Without dead ends: 200 [2024-11-05 20:29:49,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 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:49,482 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:49,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 296 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-05 20:29:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-05 20:29:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 189 states have (on average 1.5714285714285714) internal successors, (297), 191 states have internal predecessors, (297), 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:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 315 transitions. [2024-11-05 20:29:49,495 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 315 transitions. Word has length 115 [2024-11-05 20:29:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:49,495 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 315 transitions. [2024-11-05 20:29:49,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 315 transitions. [2024-11-05 20:29:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-05 20:29:49,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:49,496 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] [2024-11-05 20:29:49,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-05 20:29:49,696 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:49,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:49,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash -160117048, now seen corresponding path program 1 times [2024-11-05 20:29:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460119412] [2024-11-05 20:29:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:29:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:49,699 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:49,700 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:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:49,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:29:49,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:49,764 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:49,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:49,781 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:49,781 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460119412] [2024-11-05 20:29:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [460119412] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:49,781 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:29:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805169985] [2024-11-05 20:29:49,782 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:49,782 INFO L87 Difference]: Start difference. First operand 200 states and 315 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (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:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:49,798 INFO L93 Difference]: Finished difference Result 209 states and 325 transitions. [2024-11-05 20:29:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:29:49,798 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), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 115 [2024-11-05 20:29:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:49,799 INFO L225 Difference]: With dead ends: 209 [2024-11-05 20:29:49,799 INFO L226 Difference]: Without dead ends: 200 [2024-11-05 20:29:49,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:49,800 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:49,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-05 20:29:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-05 20:29:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 189 states have (on average 1.566137566137566) internal successors, (296), 191 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:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2024-11-05 20:29:49,812 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 115 [2024-11-05 20:29:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:49,812 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2024-11-05 20:29:49,812 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), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2024-11-05 20:29:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 20:29:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:49,813 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] [2024-11-05 20:29:49,820 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:50,016 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:50,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1555360686, now seen corresponding path program 1 times [2024-11-05 20:29:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1248149871] [2024-11-05 20:29:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:50,017 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:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:50,019 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:50,020 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:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:50,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-05 20:29:50,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:29:51,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:29:55,715 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:55,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1248149871] [2024-11-05 20:29:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1248149871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:55,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2024-11-05 20:29:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826246655] [2024-11-05 20:29:55,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-05 20:29:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-05 20:29:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3524, Unknown=0, NotChecked=0, Total=4290 [2024-11-05 20:29:55,717 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 20:30:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:11,617 INFO L93 Difference]: Finished difference Result 341 states and 532 transitions. [2024-11-05 20:30:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-05 20:30:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) Word has length 117 [2024-11-05 20:30:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:11,620 INFO L225 Difference]: With dead ends: 341 [2024-11-05 20:30:11,620 INFO L226 Difference]: Without dead ends: 318 [2024-11-05 20:30:11,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3124, Invalid=11638, Unknown=0, NotChecked=0, Total=14762 [2024-11-05 20:30:11,624 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1202 mSDsluCounter, 2935 mSDsCounter, 0 mSdLazyCounter, 5832 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3024 SdHoareTripleChecker+Invalid, 6743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 5832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:11,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3024 Invalid, 6743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 5832 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-05 20:30:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-05 20:30:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 218. [2024-11-05 20:30:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 204 states have (on average 1.5588235294117647) internal successors, (318), 207 states have internal predecessors, (318), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2024-11-05 20:30:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 350 transitions. [2024-11-05 20:30:11,669 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 350 transitions. Word has length 117 [2024-11-05 20:30:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:11,669 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 350 transitions. [2024-11-05 20:30:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 20:30:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 350 transitions. [2024-11-05 20:30:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-05 20:30:11,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:11,670 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] [2024-11-05 20:30:11,676 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:30:11,870 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:30:11,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -951776873, now seen corresponding path program 1 times [2024-11-05 20:30:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768801627] [2024-11-05 20:30:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:11,872 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:30:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:11,875 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:30:11,877 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:30:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:11,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:30:11,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:11,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:11,973 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768801627] [2024-11-05 20:30:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1768801627] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:11,974 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:30:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140253976] [2024-11-05 20:30:11,974 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:11,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:30:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:30:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:30:11,975 INFO L87 Difference]: Start difference. First operand 218 states and 350 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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:30:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:12,011 INFO L93 Difference]: Finished difference Result 228 states and 361 transitions. [2024-11-05 20:30:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:30:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 121 [2024-11-05 20:30:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:12,013 INFO L225 Difference]: With dead ends: 228 [2024-11-05 20:30:12,013 INFO L226 Difference]: Without dead ends: 218 [2024-11-05 20:30:12,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 236 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:30:12,014 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 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:30:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-05 20:30:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-05 20:30:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 204 states have (on average 1.553921568627451) internal successors, (317), 207 states have internal predecessors, (317), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2024-11-05 20:30:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 349 transitions. [2024-11-05 20:30:12,045 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 349 transitions. Word has length 121 [2024-11-05 20:30:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:12,045 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 349 transitions. [2024-11-05 20:30:12,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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:30:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 349 transitions. [2024-11-05 20:30:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-05 20:30:12,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:12,046 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] [2024-11-05 20:30:12,051 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:30:12,249 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:30:12,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:12,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1761123499, now seen corresponding path program 1 times [2024-11-05 20:30:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275978165] [2024-11-05 20:30:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:12,250 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:30:12,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:12,254 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:30:12,263 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:30:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:12,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:30:12,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:12,354 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:30:12,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:12,389 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:30:12,389 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275978165] [2024-11-05 20:30:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1275978165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:12,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-05 20:30:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968857618] [2024-11-05 20:30:12,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:30:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:30:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:30:12,390 INFO L87 Difference]: Start difference. First operand 218 states and 349 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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:30:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:12,439 INFO L93 Difference]: Finished difference Result 247 states and 395 transitions. [2024-11-05 20:30:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:30:12,439 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), 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 121 [2024-11-05 20:30:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:12,440 INFO L225 Difference]: With dead ends: 247 [2024-11-05 20:30:12,440 INFO L226 Difference]: Without dead ends: 242 [2024-11-05 20:30:12,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 236 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:30:12,441 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:12,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 277 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-05 20:30:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2024-11-05 20:30:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 225 states have (on average 1.5333333333333334) internal successors, (345), 226 states have internal predecessors, (345), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (34), 11 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-05 20:30:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 388 transitions. [2024-11-05 20:30:12,464 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 388 transitions. Word has length 121 [2024-11-05 20:30:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:12,465 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 388 transitions. [2024-11-05 20:30:12,465 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), 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:30:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 388 transitions. [2024-11-05 20:30:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-05 20:30:12,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:12,466 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] [2024-11-05 20:30:12,469 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:30:12,666 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:30:12,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash 598919099, now seen corresponding path program 1 times [2024-11-05 20:30:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312181473] [2024-11-05 20:30:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:12,667 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:30:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:12,672 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:30:12,675 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:30:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:12,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:30:12,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:12,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:12,797 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312181473] [2024-11-05 20:30:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [312181473] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:12,798 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:12,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 20:30:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020181739] [2024-11-05 20:30:12,798 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:30:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:30:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:30:12,799 INFO L87 Difference]: Start difference. First operand 241 states and 388 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), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:30:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:12,853 INFO L93 Difference]: Finished difference Result 262 states and 410 transitions. [2024-11-05 20:30:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:30:12,854 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), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 123 [2024-11-05 20:30:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:12,855 INFO L225 Difference]: With dead ends: 262 [2024-11-05 20:30:12,855 INFO L226 Difference]: Without dead ends: 256 [2024-11-05 20:30:12,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 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:30:12,856 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:12,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-05 20:30:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-05 20:30:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 241 states have internal predecessors, (361), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (34), 11 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-05 20:30:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 404 transitions. [2024-11-05 20:30:12,889 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 404 transitions. Word has length 123 [2024-11-05 20:30:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:12,890 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 404 transitions. [2024-11-05 20:30:12,890 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), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:30:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 404 transitions. [2024-11-05 20:30:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-05 20:30:12,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:12,890 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] [2024-11-05 20:30:12,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-05 20:30:13,091 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:30:13,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:13,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 656177401, now seen corresponding path program 1 times [2024-11-05 20:30:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:13,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601914551] [2024-11-05 20:30:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:13,092 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:30:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:13,094 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:30:13,096 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:30:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:13,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:30:13,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:13,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-05 20:30:13,199 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601914551] [2024-11-05 20:30:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [601914551] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:13,199 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-05 20:30:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063667444] [2024-11-05 20:30:13,199 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:30:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:30:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:30:13,200 INFO L87 Difference]: Start difference. First operand 256 states and 404 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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:30:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:13,237 INFO L93 Difference]: Finished difference Result 262 states and 409 transitions. [2024-11-05 20:30:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:30:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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 123 [2024-11-05 20:30:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:13,238 INFO L225 Difference]: With dead ends: 262 [2024-11-05 20:30:13,239 INFO L226 Difference]: Without dead ends: 245 [2024-11-05 20:30:13,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 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:30:13,239 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:13,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 293 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-05 20:30:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-11-05 20:30:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 228 states have (on average 1.513157894736842) internal successors, (345), 230 states have internal predecessors, (345), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (28), 9 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-05 20:30:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 381 transitions. [2024-11-05 20:30:13,262 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 381 transitions. Word has length 123 [2024-11-05 20:30:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:13,263 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 381 transitions. [2024-11-05 20:30:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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:30:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2024-11-05 20:30:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 20:30:13,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:13,263 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] [2024-11-05 20:30:13,268 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:30:13,464 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:30:13,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1103110160, now seen corresponding path program 1 times [2024-11-05 20:30:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:13,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1625866659] [2024-11-05 20:30:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:13,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:30:13,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:13,466 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:30:13,468 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:30:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:13,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:30:13,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:13,558 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:30:13,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:13,583 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:30:13,583 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1625866659] [2024-11-05 20:30:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1625866659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:13,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-05 20:30:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782862040] [2024-11-05 20:30:13,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:13,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:30:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:30:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:30:13,585 INFO L87 Difference]: Start difference. First operand 243 states and 381 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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:30:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:13,654 INFO L93 Difference]: Finished difference Result 251 states and 388 transitions. [2024-11-05 20:30:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 20:30:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 124 [2024-11-05 20:30:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:13,655 INFO L225 Difference]: With dead ends: 251 [2024-11-05 20:30:13,656 INFO L226 Difference]: Without dead ends: 225 [2024-11-05 20:30:13,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:30:13,656 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:13,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 392 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-05 20:30:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-05 20:30:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 211 states have (on average 1.5308056872037914) internal successors, (323), 214 states have internal predecessors, (323), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-05 20:30:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 349 transitions. [2024-11-05 20:30:13,678 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 349 transitions. Word has length 124 [2024-11-05 20:30:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:13,678 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 349 transitions. [2024-11-05 20:30:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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:30:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 349 transitions. [2024-11-05 20:30:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 20:30:13,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:13,679 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] [2024-11-05 20:30:13,687 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:30:13,880 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:30:13,880 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:13,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1474812810, now seen corresponding path program 2 times [2024-11-05 20:30:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:13,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091380920] [2024-11-05 20:30:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:13,882 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:30:13,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:13,884 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:30:13,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-05 20:30:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:13,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:30:13,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:13,962 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:30:13,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:13,998 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:30:13,998 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091380920] [2024-11-05 20:30:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2091380920] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:13,998 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:30:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285936607] [2024-11-05 20:30:13,998 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:30:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:30:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:30:13,999 INFO L87 Difference]: Start difference. First operand 225 states and 349 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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:30:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:14,058 INFO L93 Difference]: Finished difference Result 240 states and 364 transitions. [2024-11-05 20:30:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:30:14,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 125 [2024-11-05 20:30:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:14,060 INFO L225 Difference]: With dead ends: 240 [2024-11-05 20:30:14,060 INFO L226 Difference]: Without dead ends: 228 [2024-11-05 20:30:14,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:30:14,060 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:14,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-05 20:30:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2024-11-05 20:30:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 212 states have (on average 1.528301886792453) internal successors, (324), 215 states have internal predecessors, (324), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-05 20:30:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 350 transitions. [2024-11-05 20:30:14,098 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 350 transitions. Word has length 125 [2024-11-05 20:30:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:14,098 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 350 transitions. [2024-11-05 20:30:14,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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:30:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 350 transitions. [2024-11-05 20:30:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 20:30:14,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:14,099 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] [2024-11-05 20:30:14,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-05 20:30:14,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:14,299 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:14,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 888006796, now seen corresponding path program 1 times [2024-11-05 20:30:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452216678] [2024-11-05 20:30:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:14,300 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:30:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:14,302 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:30:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-05 20:30:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:14,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-05 20:30:14,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 20:30:15,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 20:30:19,059 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1452216678] [2024-11-05 20:30:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1452216678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:19,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:19,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2024-11-05 20:30:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165151563] [2024-11-05 20:30:19,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-05 20:30:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-05 20:30:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=3269, Unknown=0, NotChecked=0, Total=4032 [2024-11-05 20:30:19,065 INFO L87 Difference]: Start difference. First operand 226 states and 350 transitions. Second operand has 64 states, 64 states have (on average 2.984375) internal successors, (191), 62 states have internal predecessors, (191), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 20:30:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:33,032 INFO L93 Difference]: Finished difference Result 351 states and 515 transitions. [2024-11-05 20:30:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-05 20:30:33,032 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.984375) internal successors, (191), 62 states have internal predecessors, (191), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 125 [2024-11-05 20:30:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:33,034 INFO L225 Difference]: With dead ends: 351 [2024-11-05 20:30:33,034 INFO L226 Difference]: Without dead ends: 336 [2024-11-05 20:30:33,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3009, Invalid=10797, Unknown=0, NotChecked=0, Total=13806 [2024-11-05 20:30:33,037 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1174 mSDsluCounter, 2635 mSDsCounter, 0 mSdLazyCounter, 5664 mSolverCounterSat, 859 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 6523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 859 IncrementalHoareTripleChecker+Valid, 5664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:33,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2718 Invalid, 6523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [859 Valid, 5664 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-05 20:30:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-05 20:30:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 228. [2024-11-05 20:30:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 214 states have (on average 1.52803738317757) internal successors, (327), 216 states have internal predecessors, (327), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-05 20:30:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 353 transitions. [2024-11-05 20:30:33,063 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 353 transitions. Word has length 125 [2024-11-05 20:30:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 353 transitions. [2024-11-05 20:30:33,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.984375) internal successors, (191), 62 states have internal predecessors, (191), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 20:30:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 353 transitions. [2024-11-05 20:30:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-05 20:30:33,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:33,064 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] [2024-11-05 20:30:33,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-05 20:30:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:33,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:33,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash 989289301, now seen corresponding path program 1 times [2024-11-05 20:30:33,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:33,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1082129093] [2024-11-05 20:30:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:33,265 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:30:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:33,268 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:30:33,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-05 20:30:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:33,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:30:33,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:33,352 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:30:33,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:33,371 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:30:33,371 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1082129093] [2024-11-05 20:30:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1082129093] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:33,371 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 20:30:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097458034] [2024-11-05 20:30:33,371 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:30:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:33,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:30:33,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:30:33,372 INFO L87 Difference]: Start difference. First operand 228 states and 353 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:30:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:33,416 INFO L93 Difference]: Finished difference Result 241 states and 366 transitions. [2024-11-05 20:30:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:30:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 126 [2024-11-05 20:30:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:33,417 INFO L225 Difference]: With dead ends: 241 [2024-11-05 20:30:33,417 INFO L226 Difference]: Without dead ends: 236 [2024-11-05 20:30:33,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 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:30:33,418 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:33,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-05 20:30:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2024-11-05 20:30:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 221 states have (on average 1.51131221719457) internal successors, (334), 223 states have internal predecessors, (334), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-05 20:30:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 360 transitions. [2024-11-05 20:30:33,442 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 360 transitions. Word has length 126 [2024-11-05 20:30:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 360 transitions. [2024-11-05 20:30:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:30:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 360 transitions. [2024-11-05 20:30:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-05 20:30:33,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:33,443 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] [2024-11-05 20:30:33,448 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 (23)] Ended with exit code 0 [2024-11-05 20:30:33,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:33,647 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:33,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash -531623995, now seen corresponding path program 1 times [2024-11-05 20:30:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:33,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317353856] [2024-11-05 20:30:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:33,647 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:30:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:33,654 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:30:33,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-05 20:30:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:33,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-05 20:30:33,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 20:30:35,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 20:30:41,257 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317353856] [2024-11-05 20:30:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [317353856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:41,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2024-11-05 20:30:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505028499] [2024-11-05 20:30:41,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-05 20:30:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-05 20:30:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=4015, Unknown=0, NotChecked=0, Total=4556 [2024-11-05 20:30:41,260 INFO L87 Difference]: Start difference. First operand 235 states and 360 transitions. Second operand has 68 states, 68 states have (on average 2.8676470588235294) internal successors, (195), 66 states have internal predecessors, (195), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)