/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-loops/overflow_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:30:06,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:30:06,118 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:30:06,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:30:06,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:30:06,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:30:06,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:30:06,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:30:06,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:30:06,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:30:06,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:30:06,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:30:06,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:30:06,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:30:06,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:30:06,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:30:06,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:30:06,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:30:06,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:30:06,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:30:06,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:30:06,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:30:06,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:30:06,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:30:06,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:30:06,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:30:06,156 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:30:06,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:30:06,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:30:06,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:30:06,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:30:06,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:30:06,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:30:06,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:30:06,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:30:06,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:30:06,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:30:06,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:30:06,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:30:06,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:30:06,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:30:06,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:30:06,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:30:06,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:30:06,159 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:30:06,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:30:06,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:30:06,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:30:06,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:30:06,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:30:06,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/overflow_1-2.c [2024-11-05 20:30:07,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:30:07,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:30:07,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/overflow_1-2.c [2024-11-05 20:30:07,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205ace800/dbce9be28c0544a48389b5ca58218458/FLAG05ce90c20 [2024-11-05 20:30:08,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205ace800/dbce9be28c0544a48389b5ca58218458 [2024-11-05 20:30:08,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:30:08,386 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:30:08,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:30:08,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:30:08,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:30:08,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd0ada5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08, skipping insertion in model container [2024-11-05 20:30:08,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:30:08,556 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-loops/overflow_1-2.c[324,337] [2024-11-05 20:30:08,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:30:08,573 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:30:08,581 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-loops/overflow_1-2.c[324,337] [2024-11-05 20:30:08,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:30:08,597 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:30:08,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08 WrapperNode [2024-11-05 20:30:08,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:30:08,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:30:08,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:30:08,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:30:08,605 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:30:08" (1/1) ... [2024-11-05 20:30:08,612 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:30:08" (1/1) ... [2024-11-05 20:30:08,624 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-11-05 20:30:08,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:30:08,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:30:08,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:30:08,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:30:08,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,641 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:30:08,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:30:08,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:30:08,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:30:08,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:30:08,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (1/1) ... [2024-11-05 20:30:08,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:30:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:30:08,683 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:30:08,686 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:30:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:30:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:30:08,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:30:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:30:08,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:30:08,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:30:08,861 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-05 20:30:08,861 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:30:08,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:30:08,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:30:08,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:30:08 BoogieIcfgContainer [2024-11-05 20:30:08,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:30:08,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:30:08,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:30:08,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:30:08,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:30:08" (1/3) ... [2024-11-05 20:30:08,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0b16bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:30:08, skipping insertion in model container [2024-11-05 20:30:08,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:30:08" (2/3) ... [2024-11-05 20:30:08,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0b16bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:30:08, skipping insertion in model container [2024-11-05 20:30:08,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:30:08" (3/3) ... [2024-11-05 20:30:08,884 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_1-2.c [2024-11-05 20:30:08,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:30:08,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:30:08,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:30:08,949 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;@7dbf8255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:30:08,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:30:08,954 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-05 20:30:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-05 20:30:08,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:08,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-05 20:30:08,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:08,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2024-11-05 20:30:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721544778] [2024-11-05 20:30:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:08,972 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:30:08,973 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:30:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:09,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:30:09,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:09,078 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-05 20:30:09,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:09,098 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-05 20:30:09,099 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:09,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721544778] [2024-11-05 20:30:09,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1721544778] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:09,100 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:09,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:30:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978590245] [2024-11-05 20:30:09,103 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:09,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:30:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:30:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:30:09,126 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-05 20:30:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:09,149 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-11-05 20:30:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:30:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 [2024-11-05 20:30:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:09,157 INFO L225 Difference]: With dead ends: 21 [2024-11-05 20:30:09,157 INFO L226 Difference]: Without dead ends: 9 [2024-11-05 20:30:09,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:30:09,165 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:09,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-05 20:30:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-05 20:30:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 20:30:09,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-05 20:30:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 20:30:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-05 20:30:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 20:30:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 20:30:09,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:09,191 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:09,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 20:30:09,391 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:30:09,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times [2024-11-05 20:30:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696721329] [2024-11-05 20:30:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:09,398 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:30:09,399 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:30:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:09,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:30:09,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:09,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:09,547 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696721329] [2024-11-05 20:30:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [696721329] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:09,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:30:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466073887] [2024-11-05 20:30:09,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:30:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:30:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:30:09,554 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-05 20:30:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:09,629 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-05 20:30:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:30:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Word has length 8 [2024-11-05 20:30:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:09,630 INFO L225 Difference]: With dead ends: 17 [2024-11-05 20:30:09,648 INFO L226 Difference]: Without dead ends: 13 [2024-11-05 20:30:09,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:30:09,650 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:09,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:30:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-05 20:30:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-05 20:30:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-05 20:30:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-05 20:30:09,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2024-11-05 20:30:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:09,658 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-05 20:30:09,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-05 20:30:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-05 20:30:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-05 20:30:09,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:09,659 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:09,662 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:30:09,859 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:30:09,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 2 times [2024-11-05 20:30:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:09,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604102334] [2024-11-05 20:30:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:09,864 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:30:09,865 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:30:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:09,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:30:09,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:10,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:10,166 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1604102334] [2024-11-05 20:30:10,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1604102334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:10,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:10,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 20:30:10,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882707747] [2024-11-05 20:30:10,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:10,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:30:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:30:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:30:10,169 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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-05 20:30:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:10,449 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-05 20:30:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 20:30:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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 12 [2024-11-05 20:30:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:10,452 INFO L225 Difference]: With dead ends: 25 [2024-11-05 20:30:10,452 INFO L226 Difference]: Without dead ends: 21 [2024-11-05 20:30:10,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2024-11-05 20:30:10,454 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:10,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:30:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-05 20:30:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-05 20:30:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-05 20:30:10,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2024-11-05 20:30:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-05 20:30:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 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-05 20:30:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-05 20:30:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-05 20:30:10,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:10,466 INFO L215 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:10,470 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:30:10,668 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:30:10,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:10,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2078182539, now seen corresponding path program 3 times [2024-11-05 20:30:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173118883] [2024-11-05 20:30:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:10,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:30:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:10,673 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:30:10,674 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:30:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:10,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-05 20:30:10,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:10,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:11,368 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173118883] [2024-11-05 20:30:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [173118883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:11,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-05 20:30:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483059945] [2024-11-05 20:30:11,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-05 20:30:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:11,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-05 20:30:11,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-05 20:30:11,372 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:12,564 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-11-05 20:30:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-05 20:30:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 20 [2024-11-05 20:30:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:12,565 INFO L225 Difference]: With dead ends: 41 [2024-11-05 20:30:12,566 INFO L226 Difference]: Without dead ends: 37 [2024-11-05 20:30:12,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=762, Invalid=1400, Unknown=0, NotChecked=0, Total=2162 [2024-11-05 20:30:12,568 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:12,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:30:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-05 20:30:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-05 20:30:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-05 20:30:12,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2024-11-05 20:30:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:12,576 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-11-05 20:30:12,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-05 20:30:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:30:12,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:12,577 INFO L215 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:12,581 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:30:12,778 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:30:12,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -24784501, now seen corresponding path program 4 times [2024-11-05 20:30:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:12,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017955766] [2024-11-05 20:30:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:12,781 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:30:12,783 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:30:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:12,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 20:30:12,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:13,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:14,825 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017955766] [2024-11-05 20:30:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1017955766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:14,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2024-11-05 20:30:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414298831] [2024-11-05 20:30:14,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:14,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-05 20:30:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-05 20:30:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2024-11-05 20:30:14,831 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 64 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:20,753 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-11-05 20:30:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-05 20:30:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 36 [2024-11-05 20:30:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:20,755 INFO L225 Difference]: With dead ends: 73 [2024-11-05 20:30:20,755 INFO L226 Difference]: Without dead ends: 69 [2024-11-05 20:30:20,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3066, Invalid=5864, Unknown=0, NotChecked=0, Total=8930 [2024-11-05 20:30:20,757 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:20,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:30:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-05 20:30:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-05 20:30:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2024-11-05 20:30:20,769 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2024-11-05 20:30:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2024-11-05 20:30:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2024-11-05 20:30:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 20:30:20,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:20,772 INFO L215 NwaCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:20,775 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:30:20,973 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:30:20,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:20,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1750489995, now seen corresponding path program 5 times [2024-11-05 20:30:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059247827] [2024-11-05 20:30:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:20,976 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:30:20,977 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:30:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:21,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-05 20:30:21,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:22,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:30:27,355 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059247827] [2024-11-05 20:30:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059247827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:27,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 128 [2024-11-05 20:30:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396697025] [2024-11-05 20:30:27,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-05 20:30:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-05 20:30:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2024-11-05 20:30:27,362 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 128 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:31:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:31:07,551 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2024-11-05 20:31:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-05 20:31:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 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 68 [2024-11-05 20:31:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:31:07,554 INFO L225 Difference]: With dead ends: 137 [2024-11-05 20:31:07,554 INFO L226 Difference]: Without dead ends: 133 [2024-11-05 20:31:07,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=12282, Invalid=24008, Unknown=0, NotChecked=0, Total=36290 [2024-11-05 20:31:07,560 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4179 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:31:07,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4179 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-05 20:31:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-05 20:31:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-05 20:31:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:31:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2024-11-05 20:31:07,590 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 68 [2024-11-05 20:31:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:31:07,590 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2024-11-05 20:31:07,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:31:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2024-11-05 20:31:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 20:31:07,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:31:07,594 INFO L215 NwaCegarLoop]: trace histogram [126, 1, 1, 1, 1, 1, 1] [2024-11-05 20:31:07,599 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:31:07,796 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:31:07,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:31:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:31:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -33591413, now seen corresponding path program 6 times [2024-11-05 20:31:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:31:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984258372] [2024-11-05 20:31:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:31:07,798 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:31:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:31:07,799 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:31:07,800 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:31:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:31:07,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-05 20:31:07,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:31:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:31:13,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:31:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:31:33,283 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:31:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984258372] [2024-11-05 20:31:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [984258372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:31:33,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:31:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 256 [2024-11-05 20:31:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923721951] [2024-11-05 20:31:33,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:31:33,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2024-11-05 20:31:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:31:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2024-11-05 20:31:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16638, Invalid=48642, Unknown=0, NotChecked=0, Total=65280 [2024-11-05 20:31:33,293 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand has 256 states, 256 states have (on average 1.015625) internal successors, (260), 256 states have internal predecessors, (260), 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)