/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/jain_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:59:58,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:59:58,697 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-03 08:59:58,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:59:58,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:59:58,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:59:58,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:59:58,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:59:58,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:59:58,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:59:58,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:59:58,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:59:58,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:59:58,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:59:58,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:59:58,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:59:58,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:59:58,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:59:58,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:59:58,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:59:58,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:59:58,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:59:58,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:59:58,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:59:58,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:59:58,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:59:58,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:59:58,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:59:58,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:59:58,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:59:58,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:59:58,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:59:58,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:59:58,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:59:58,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:59:58,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:59:58,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:59:58,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:59:58,740 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:59:58,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:59:58,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:59:58,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:59:58,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:59:58,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:59:58,741 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-03 08:59:58,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:59:59,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:59:59,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:59:59,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:59:59,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:59:59,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/jain_5-2.c [2024-11-03 09:00:00,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:00:00,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:00:00,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/jain_5-2.c [2024-11-03 09:00:00,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7d2a92d/0e05f3077d7648639cd4f0061b49aeef/FLAGd288fd09f [2024-11-03 09:00:00,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7d2a92d/0e05f3077d7648639cd4f0061b49aeef [2024-11-03 09:00:00,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:00:00,596 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:00:00,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:00,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:00:00,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:00:00,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173ac39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00, skipping insertion in model container [2024-11-03 09:00:00,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:00:00,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/jain_5-2.c[665,678] [2024-11-03 09:00:00,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:00,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:00:00,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/jain_5-2.c[665,678] [2024-11-03 09:00:00,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:00,844 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:00:00,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00 WrapperNode [2024-11-03 09:00:00,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:00,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:00,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:00:00,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:00:00,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,876 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2024-11-03 09:00:00,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:00,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:00:00,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:00:00,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:00:00,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,900 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-03 09:00:00,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:00:00,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:00:00,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:00:00,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:00:00,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (1/1) ... [2024-11-03 09:00:00,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:00:00,949 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-03 09:00:00,952 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-03 09:00:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:00:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:00:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:00:00,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:00:01,029 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:00:01,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:00:01,141 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-03 09:00:01,141 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:00:01,151 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:00:01,151 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:00:01,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:01 BoogieIcfgContainer [2024-11-03 09:00:01,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:00:01,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:00:01,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:00:01,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:00:01,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:00:00" (1/3) ... [2024-11-03 09:00:01,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77af9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:01, skipping insertion in model container [2024-11-03 09:00:01,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:00" (2/3) ... [2024-11-03 09:00:01,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77af9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:01, skipping insertion in model container [2024-11-03 09:00:01,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:01" (3/3) ... [2024-11-03 09:00:01,159 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2024-11-03 09:00:01,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:00:01,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:00:01,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:00:01,231 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;@12a2337d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:00:01,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:00:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-03 09:00:01,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:01,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-03 09:00:01,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:01,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2024-11-03 09:00:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879819668] [2024-11-03 09:00:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:01,256 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-03 09:00:01,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:01,260 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-03 09:00:01,262 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-03 09:00:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:01,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:00:01,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:01,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:01,541 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879819668] [2024-11-03 09:00:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [879819668] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:01,543 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 09:00:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280141500] [2024-11-03 09:00:01,546 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:00:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:00:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:00:01,575 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:01,650 INFO L93 Difference]: Finished difference Result 21 states and 32 transitions. [2024-11-03 09:00:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:00:01,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-03 09:00:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:01,659 INFO L225 Difference]: With dead ends: 21 [2024-11-03 09:00:01,659 INFO L226 Difference]: Without dead ends: 12 [2024-11-03 09:00:01,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:00:01,666 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:01,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-03 09:00:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-03 09:00:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-03 09:00:01,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2024-11-03 09:00:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:01,698 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-03 09:00:01,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-03 09:00:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-03 09:00:01,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:01,700 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-03 09:00:01,704 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-03 09:00:01,903 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-03 09:00:01,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:01,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:01,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1534070422, now seen corresponding path program 1 times [2024-11-03 09:00:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878955267] [2024-11-03 09:00:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:01,905 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-03 09:00:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:01,909 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-03 09:00:01,910 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-03 09:00:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:01,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-03 09:00:01,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:02,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:02,278 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878955267] [2024-11-03 09:00:02,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [878955267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:02,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 09:00:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17821957] [2024-11-03 09:00:02,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 09:00:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 09:00:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-03 09:00:02,283 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:02,593 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-03 09:00:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-03 09:00:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-03 09:00:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:02,595 INFO L225 Difference]: With dead ends: 26 [2024-11-03 09:00:02,595 INFO L226 Difference]: Without dead ends: 24 [2024-11-03 09:00:02,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-03 09:00:02,599 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:02,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-03 09:00:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-03 09:00:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-03 09:00:02,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2024-11-03 09:00:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-03 09:00:02,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-03 09:00:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-03 09:00:02,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:02,609 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2024-11-03 09:00:02,613 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-03 09:00:02,809 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-03 09:00:02,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:02,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1980545898, now seen corresponding path program 2 times [2024-11-03 09:00:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441397362] [2024-11-03 09:00:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:02,812 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-03 09:00:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:02,813 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-03 09:00:02,814 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-03 09:00:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:02,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-03 09:00:02,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:03,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:03,598 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441397362] [2024-11-03 09:00:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [441397362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:03,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 09:00:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507467591] [2024-11-03 09:00:03,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 09:00:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 09:00:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-03 09:00:03,601 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:05,053 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-11-03 09:00:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-03 09:00:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-03 09:00:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:05,054 INFO L225 Difference]: With dead ends: 50 [2024-11-03 09:00:05,054 INFO L226 Difference]: Without dead ends: 48 [2024-11-03 09:00:05,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2024-11-03 09:00:05,056 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:05,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-03 09:00:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-03 09:00:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-03 09:00:05,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 23 [2024-11-03 09:00:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:05,070 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2024-11-03 09:00:05,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-03 09:00:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-03 09:00:05,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:05,071 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2024-11-03 09:00:05,075 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-03 09:00:05,274 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-03 09:00:05,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1964421270, now seen corresponding path program 3 times [2024-11-03 09:00:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:05,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178428676] [2024-11-03 09:00:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:05,279 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-03 09:00:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:05,282 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-03 09:00:05,283 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-03 09:00:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:05,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-03 09:00:05,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:05,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:07,484 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178428676] [2024-11-03 09:00:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [178428676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:07,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-03 09:00:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674557717] [2024-11-03 09:00:07,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:07,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-03 09:00:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-03 09:00:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-03 09:00:07,487 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:15,981 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-11-03 09:00:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-03 09:00:15,982 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-03 09:00:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:15,983 INFO L225 Difference]: With dead ends: 98 [2024-11-03 09:00:15,983 INFO L226 Difference]: Without dead ends: 96 [2024-11-03 09:00:15,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1815, Invalid=4037, Unknown=0, NotChecked=0, Total=5852 [2024-11-03 09:00:15,986 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:15,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 280 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-03 09:00:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-03 09:00:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-03 09:00:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2024-11-03 09:00:16,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 47 [2024-11-03 09:00:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:16,016 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2024-11-03 09:00:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2024-11-03 09:00:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-03 09:00:16,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:16,018 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2024-11-03 09:00:16,022 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-03 09:00:16,219 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-03 09:00:16,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:16,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1305577622, now seen corresponding path program 4 times [2024-11-03 09:00:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642144628] [2024-11-03 09:00:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:16,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:16,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:16,222 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-03 09:00:16,223 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-03 09:00:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:16,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-03 09:00:16,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:17,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:22,808 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642144628] [2024-11-03 09:00:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [642144628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:22,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:22,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-11-03 09:00:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630873902] [2024-11-03 09:00:22,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-03 09:00:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-03 09:00:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=3199, Unknown=0, NotChecked=0, Total=4290 [2024-11-03 09:00:22,813 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 66 states, 66 states have (on average 2.8484848484848486) internal successors, (188), 66 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:32,810 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2024-11-03 09:01:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-11-03 09:01:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.8484848484848486) internal successors, (188), 66 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-03 09:01:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:32,813 INFO L225 Difference]: With dead ends: 194 [2024-11-03 09:01:32,813 INFO L226 Difference]: Without dead ends: 192 [2024-11-03 09:01:32,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5026 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=7471, Invalid=17021, Unknown=0, NotChecked=0, Total=24492 [2024-11-03 09:01:32,819 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:32,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1064 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-03 09:01:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-03 09:01:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-03 09:01:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2024-11-03 09:01:32,881 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 95 [2024-11-03 09:01:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2024-11-03 09:01:32,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.8484848484848486) internal successors, (188), 66 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2024-11-03 09:01:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-03 09:01:32,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:32,885 INFO L215 NwaCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1] [2024-11-03 09:01:32,890 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-03 09:01:33,085 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-03 09:01:33,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:33,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1494694038, now seen corresponding path program 5 times [2024-11-03 09:01:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:33,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069319834] [2024-11-03 09:01:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:33,086 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-03 09:01:33,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:33,088 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-03 09:01:33,089 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-03 09:01:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:33,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-11-03 09:01:33,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:01:36,198 INFO L311 TraceCheckSpWp]: Computing backward predicates...