/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/floats-esbmc-regression/floor_nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:47:02,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:47:02,968 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:47:02,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:47:02,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:47:02,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:47:02,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:47:02,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:47:03,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:47:03,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:47:03,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:47:03,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:47:03,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:47:03,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:47:03,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:47:03,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:47:03,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:47:03,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:47:03,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:47:03,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:47:03,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:47:03,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:47:03,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:47:03,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:47:03,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:47:03,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:47:03,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:47:03,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:47:03,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:47:03,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:47:03,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:47:03,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:47:03,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:47:03,009 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:47:03,010 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:47:03,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:47:03,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:47:03,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:47:03,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:47:03,011 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:47:03,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:47:03,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:47:03,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:47:03,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:47:03,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:47:03,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/floor_nondet.i [2024-11-05 20:47:04,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:47:04,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:47:04,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/floor_nondet.i [2024-11-05 20:47:04,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79eaa78e/a65b854932ec441e879cfb09d4220602/FLAG6d2fcd319 [2024-11-05 20:47:04,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79eaa78e/a65b854932ec441e879cfb09d4220602 [2024-11-05 20:47:04,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:47:04,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:47:04,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:47:04,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:47:04,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:47:04,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:47:04" (1/1) ... [2024-11-05 20:47:04,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c46afe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:04, skipping insertion in model container [2024-11-05 20:47:04,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:47:04" (1/1) ... [2024-11-05 20:47:04,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:47:05,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/floor_nondet.i[38163,38176] [2024-11-05 20:47:05,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:47:05,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:47:05,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/floor_nondet.i[38163,38176] [2024-11-05 20:47:05,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:47:05,343 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:47:05,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05 WrapperNode [2024-11-05 20:47:05,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:47:05,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:47:05,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:47:05,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:47:05,351 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:47:05" (1/1) ... [2024-11-05 20:47:05,375 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:47:05" (1/1) ... [2024-11-05 20:47:05,396 INFO L138 Inliner]: procedures = 461, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2024-11-05 20:47:05,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:47:05,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:47:05,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:47:05,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:47:05,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,419 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:47:05,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:47:05,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:47:05,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:47:05,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:47:05,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (1/1) ... [2024-11-05 20:47:05,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:47:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:47:05,465 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:47:05,467 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:47:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:47:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 20:47:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 20:47:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:47:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:47:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:47:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:47:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:47:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-11-05 20:47:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-11-05 20:47:05,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:47:05,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:47:05,689 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-05 20:47:05,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:47:05,700 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:47:05,700 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 20:47:05,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:47:05 BoogieIcfgContainer [2024-11-05 20:47:05,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:47:05,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:47:05,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:47:05,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:47:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:47:04" (1/3) ... [2024-11-05 20:47:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f0b5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:47:05, skipping insertion in model container [2024-11-05 20:47:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:47:05" (2/3) ... [2024-11-05 20:47:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f0b5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:47:05, skipping insertion in model container [2024-11-05 20:47:05,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:47:05" (3/3) ... [2024-11-05 20:47:05,707 INFO L112 eAbstractionObserver]: Analyzing ICFG floor_nondet.i [2024-11-05 20:47:05,720 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:47:05,720 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:47:05,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:47:05,763 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;@6c939480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:47:05,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:47:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 20:47:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-05 20:47:05,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:05,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:05,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:05,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -632255995, now seen corresponding path program 1 times [2024-11-05 20:47:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:05,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866069767] [2024-11-05 20:47:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:05,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:47:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:05,792 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:47:05,793 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:47:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:05,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:47:05,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 20:47:05,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:47:05,967 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866069767] [2024-11-05 20:47:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [866069767] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:47:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:47:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-05 20:47:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537509122] [2024-11-05 20:47:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:05,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:47:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:05,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:47:05,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:47:05,994 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:47:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:06,034 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2024-11-05 20:47:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:47:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 27 [2024-11-05 20:47:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:06,043 INFO L225 Difference]: With dead ends: 71 [2024-11-05 20:47:06,044 INFO L226 Difference]: Without dead ends: 34 [2024-11-05 20:47:06,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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:47:06,049 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:06,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:47:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-05 20:47:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-05 20:47:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-05 20:47:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-05 20:47:06,079 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2024-11-05 20:47:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:06,080 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-05 20:47:06,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:47:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-05 20:47:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 20:47:06,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:06,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:06,086 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:47:06,285 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:47:06,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:06,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2136548126, now seen corresponding path program 1 times [2024-11-05 20:47:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1523222082] [2024-11-05 20:47:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:06,287 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:47:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:06,289 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:47:06,291 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:47:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:06,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:47:06,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 20:47:06,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:47:06,432 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1523222082] [2024-11-05 20:47:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1523222082] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:47:06,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:47:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-05 20:47:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262838460] [2024-11-05 20:47:06,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:06,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:47:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:47:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:47:06,435 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:47:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:06,457 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-05 20:47:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:47:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 28 [2024-11-05 20:47:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:06,458 INFO L225 Difference]: With dead ends: 64 [2024-11-05 20:47:06,458 INFO L226 Difference]: Without dead ends: 36 [2024-11-05 20:47:06,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:47:06,460 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:06,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:47:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-05 20:47:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-05 20:47:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-05 20:47:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-05 20:47:06,466 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2024-11-05 20:47:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:06,466 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-05 20:47:06,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:47:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-05 20:47:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-05 20:47:06,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:06,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:06,471 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:47:06,668 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:47:06,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:06,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1302988330, now seen corresponding path program 1 times [2024-11-05 20:47:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602175108] [2024-11-05 20:47:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:06,670 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:47:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:06,671 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:47:06,673 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:47:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:06,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:47:06,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 20:47:06,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:47:06,780 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:06,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602175108] [2024-11-05 20:47:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [602175108] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:47:06,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:47:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-05 20:47:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122494781] [2024-11-05 20:47:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:06,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:47:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:47:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:47:06,783 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:47:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:06,811 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-05 20:47:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:47:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 29 [2024-11-05 20:47:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:06,812 INFO L225 Difference]: With dead ends: 64 [2024-11-05 20:47:06,812 INFO L226 Difference]: Without dead ends: 36 [2024-11-05 20:47:06,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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:47:06,813 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:06,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:47:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-05 20:47:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-05 20:47:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-05 20:47:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-05 20:47:06,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 29 [2024-11-05 20:47:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-05 20:47:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:47:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-05 20:47:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-05 20:47:06,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:06,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:06,825 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:47:07,024 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:47:07,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -912578969, now seen corresponding path program 1 times [2024-11-05 20:47:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574368441] [2024-11-05 20:47:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:07,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:47:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:07,028 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:47:07,029 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:47:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:07,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:47:07,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:47:07,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:47:07,319 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1574368441] [2024-11-05 20:47:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1574368441] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:47:07,320 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:47:07,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 6 [2024-11-05 20:47:07,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767830327] [2024-11-05 20:47:07,320 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:07,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:47:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:07,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:47:07,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:47:07,321 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:07,535 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-11-05 20:47:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:47:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2024-11-05 20:47:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:07,539 INFO L225 Difference]: With dead ends: 82 [2024-11-05 20:47:07,540 INFO L226 Difference]: Without dead ends: 62 [2024-11-05 20:47:07,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:47:07,541 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:07,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 182 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:47:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-05 20:47:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-05 20:47:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 20:47:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2024-11-05 20:47:07,549 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 30 [2024-11-05 20:47:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:07,549 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2024-11-05 20:47:07,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2024-11-05 20:47:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 20:47:07,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:07,550 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:07,554 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:47:07,751 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:47:07,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash 932323024, now seen corresponding path program 1 times [2024-11-05 20:47:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692808829] [2024-11-05 20:47:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:07,752 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:47:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:07,753 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:47:07,754 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:47:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:07,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:47:07,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:47:07,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:47:07,946 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692808829] [2024-11-05 20:47:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1692808829] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:47:07,946 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:47:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 20:47:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864593003] [2024-11-05 20:47:07,946 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:47:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:47:07,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:47:07,947 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:08,439 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-05 20:47:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:47:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2024-11-05 20:47:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:08,443 INFO L225 Difference]: With dead ends: 80 [2024-11-05 20:47:08,443 INFO L226 Difference]: Without dead ends: 60 [2024-11-05 20:47:08,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:47:08,444 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:08,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 153 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:47:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-05 20:47:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-05 20:47:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-05 20:47:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-05 20:47:08,453 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 31 [2024-11-05 20:47:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:08,454 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-05 20:47:08,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-05 20:47:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-05 20:47:08,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:08,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:08,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 20:47:08,659 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:47:08,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:08,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1881140254, now seen corresponding path program 1 times [2024-11-05 20:47:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:08,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554757729] [2024-11-05 20:47:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:08,661 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:47:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:08,664 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:47:08,665 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:47:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:08,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:47:08,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 20:47:08,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 20:47:08,816 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554757729] [2024-11-05 20:47:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1554757729] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:47:08,816 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:47:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 6 [2024-11-05 20:47:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633136276] [2024-11-05 20:47:08,817 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:47:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:08,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:47:08,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:47:08,819 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:09,039 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2024-11-05 20:47:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:47:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32 [2024-11-05 20:47:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:09,044 INFO L225 Difference]: With dead ends: 78 [2024-11-05 20:47:09,044 INFO L226 Difference]: Without dead ends: 58 [2024-11-05 20:47:09,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:47:09,045 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:09,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 213 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:47:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-05 20:47:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-05 20:47:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-05 20:47:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-11-05 20:47:09,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 32 [2024-11-05 20:47:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:09,051 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-11-05 20:47:09,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-05 20:47:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-05 20:47:09,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:09,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:09,055 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:47:09,252 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:47:09,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1219928427, now seen corresponding path program 1 times [2024-11-05 20:47:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590513200] [2024-11-05 20:47:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:09,253 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:47:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:09,257 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:47:09,258 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:47:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:47:09,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:47:09,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:47:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 20:47:09,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:47:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 20:47:09,421 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:47:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590513200] [2024-11-05 20:47:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1590513200] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:47:09,421 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:47:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 6 [2024-11-05 20:47:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7684173] [2024-11-05 20:47:09,422 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:47:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:47:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:47:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:47:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:47:09,423 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:47:09,499 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-05 20:47:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:47:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33 [2024-11-05 20:47:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:47:09,500 INFO L225 Difference]: With dead ends: 86 [2024-11-05 20:47:09,500 INFO L226 Difference]: Without dead ends: 42 [2024-11-05 20:47:09,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:47:09,501 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:47:09,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:47:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-05 20:47:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-05 20:47:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 20:47:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-05 20:47:09,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 33 [2024-11-05 20:47:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:47:09,506 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-05 20:47:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 20:47:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-05 20:47:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-05 20:47:09,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:47:09,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:09,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-05 20:47:09,707 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:47:09,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:47:09,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:47:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 410581801, now seen corresponding path program 1 times [2024-11-05 20:47:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:47:09,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538482331] [2024-11-05 20:47:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:47:09,709 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:47:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:47:09,711 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:47:09,712 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:47:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 20:47:09,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 20:47:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 20:47:09,814 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 20:47:09,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 20:47:09,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:47:09,823 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:47:10,017 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:47:10,020 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:47:10,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:47:10,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:47:10 BoogieIcfgContainer [2024-11-05 20:47:10,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:47:10,044 INFO L158 Benchmark]: Toolchain (without parser) took 5296.67ms. Allocated memory is still 375.4MB. Free memory was 333.2MB in the beginning and 167.1MB in the end (delta: 166.2MB). Peak memory consumption was 167.2MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,044 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:47:10,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.27ms. Allocated memory is still 375.4MB. Free memory was 333.2MB in the beginning and 282.9MB in the end (delta: 50.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.99ms. Allocated memory is still 375.4MB. Free memory was 282.9MB in the beginning and 280.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,045 INFO L158 Benchmark]: Boogie Preprocessor took 38.67ms. Allocated memory is still 375.4MB. Free memory was 280.3MB in the beginning and 278.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,045 INFO L158 Benchmark]: RCFGBuilder took 263.75ms. Allocated memory is still 375.4MB. Free memory was 277.7MB in the beginning and 263.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,045 INFO L158 Benchmark]: TraceAbstraction took 4340.93ms. Allocated memory is still 375.4MB. Free memory was 263.0MB in the beginning and 167.1MB in the end (delta: 95.9MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2024-11-05 20:47:10,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 597.27ms. Allocated memory is still 375.4MB. Free memory was 333.2MB in the beginning and 282.9MB in the end (delta: 50.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.99ms. Allocated memory is still 375.4MB. Free memory was 282.9MB in the beginning and 280.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.67ms. Allocated memory is still 375.4MB. Free memory was 280.3MB in the beginning and 278.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 263.75ms. Allocated memory is still 375.4MB. Free memory was 277.7MB in the beginning and 263.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4340.93ms. Allocated memory is still 375.4MB. Free memory was 263.0MB in the beginning and 167.1MB in the end (delta: 95.9MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1005]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of rint at line 1017. Possible FailurePath: [L1011] double d = __VERIFIER_nondet_double(); [L1012] CALL assume_abort_if_not(!(sizeof (d) == sizeof (float) ? __isinff (d) : sizeof (d) == sizeof (double) ? __isinf (d) : __isinfl (d))) VAL [\old(cond)=1] [L991] COND FALSE !(!cond) VAL [\old(cond)=1] [L1012] RET assume_abort_if_not(!(sizeof (d) == sizeof (float) ? __isinff (d) : sizeof (d) == sizeof (double) ? __isinf (d) : __isinfl (d))) VAL [d=0.0] [L1013] CALL assume_abort_if_not(!(sizeof (d) == sizeof (float) ? __isnanf (d) : sizeof (d) == sizeof (double) ? __isnan (d) : __isnanl (d))) VAL [\old(cond)=1] [L991] COND FALSE !(!cond) VAL [\old(cond)=1] [L1013] RET assume_abort_if_not(!(sizeof (d) == sizeof (float) ? __isnanf (d) : sizeof (d) == sizeof (double) ? __isnan (d) : __isnanl (d))) VAL [d=0.0] [L1015] int save_round = fegetround(); VAL [d=0.0, save_round=1] [L1016] FCALL fesetround(0x400) VAL [d=0.0, save_round=1] [L1017] double result = rint(d); [L1018] FCALL fesetround(save_round) VAL [d=0.0, result=2.0, save_round=1] [L1020] CALL __VERIFIER_assert(floor(d) == result) VAL [\old(cond)=0] [L1005] COND TRUE !(cond) VAL [\old(cond)=0] [L1005] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 883 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 318 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 SizeOfPredicates, 4 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 104/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-05 20:47:10,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...