/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/byte_add_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 08:58:59,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 08:58:59,349 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:58:59,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 08:58:59,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 08:58:59,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 08:58:59,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 08:58:59,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 08:58:59,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 08:58:59,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 08:58:59,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 08:58:59,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 08:58:59,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 08:58:59,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 08:58:59,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 08:58:59,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 08:58:59,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 08:58:59,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 08:58:59,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 08:58:59,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 08:58:59,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 08:58:59,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 08:58:59,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 08:58:59,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 08:58:59,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 08:58:59,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 08:58:59,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 08:58:59,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 08:58:59,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 08:58:59,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:58:59,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 08:58:59,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 08:58:59,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 08:58:59,388 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 08:58:59,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 08:58:59,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 08:58:59,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 08:58:59,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 08:58:59,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 08:58:59,392 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:58:59,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 08:58:59,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 08:58:59,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 08:58:59,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 08:58:59,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 08:58:59,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2024-11-03 08:59:00,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 08:59:00,952 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 08:59:00,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2024-11-03 08:59:00,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6428cd159/fd7065477806427b8ea627344647f372/FLAG022014fe0 [2024-11-03 08:59:00,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6428cd159/fd7065477806427b8ea627344647f372 [2024-11-03 08:59:00,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 08:59:00,973 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 08:59:00,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 08:59:00,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 08:59:00,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 08:59:00,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:59:00" (1/1) ... [2024-11-03 08:59:00,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e88f903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:00, skipping insertion in model container [2024-11-03 08:59:00,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 08:59:00" (1/1) ... [2024-11-03 08:59:00,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 08:59:01,126 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/byte_add_1-1.i[1168,1181] [2024-11-03 08:59:01,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:59:01,164 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 08:59:01,173 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/byte_add_1-1.i[1168,1181] [2024-11-03 08:59:01,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 08:59:01,203 INFO L204 MainTranslator]: Completed translation [2024-11-03 08:59:01,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01 WrapperNode [2024-11-03 08:59:01,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 08:59:01,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 08:59:01,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 08:59:01,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 08:59:01,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,241 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-03 08:59:01,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 08:59:01,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 08:59:01,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 08:59:01,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 08:59:01,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,262 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 08:59:01,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 08:59:01,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 08:59:01,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 08:59:01,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 08:59:01,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (1/1) ... [2024-11-03 08:59:01,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 08:59:01,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 08:59:01,305 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 08:59:01,308 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 08:59:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 08:59:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 08:59:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 08:59:01,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 08:59:01,407 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 08:59:01,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 08:59:01,705 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-03 08:59:01,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 08:59:01,716 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 08:59:01,716 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 08:59:01,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:59:01 BoogieIcfgContainer [2024-11-03 08:59:01,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 08:59:01,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 08:59:01,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 08:59:01,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 08:59:01,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 08:59:00" (1/3) ... [2024-11-03 08:59:01,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:59:01, skipping insertion in model container [2024-11-03 08:59:01,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 08:59:01" (2/3) ... [2024-11-03 08:59:01,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 08:59:01, skipping insertion in model container [2024-11-03 08:59:01,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 08:59:01" (3/3) ... [2024-11-03 08:59:01,724 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-03 08:59:01,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 08:59:01,738 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 08:59:01,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 08:59:01,789 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;@7a97af26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 08:59:01,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 08:59:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 08:59:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 08:59:01,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:01,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:01,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-03 08:59:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1729349559] [2024-11-03 08:59:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:01,814 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 08:59:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:01,818 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 08:59:01,824 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 08:59:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:01,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 08:59:01,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:01,900 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 08:59:01,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:01,904 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 08:59:01,904 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1729349559] [2024-11-03 08:59:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1729349559] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:01,905 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:01,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 08:59:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051424344] [2024-11-03 08:59:01,907 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:01,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 08:59:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 08:59:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:59:01,930 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 08:59:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:01,944 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-03 08:59:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 08:59:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 12 [2024-11-03 08:59:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:01,956 INFO L225 Difference]: With dead ends: 57 [2024-11-03 08:59:01,957 INFO L226 Difference]: Without dead ends: 38 [2024-11-03 08:59:01,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 08:59:01,966 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:01,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:59:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-03 08:59:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-03 08:59:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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 08:59:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-03 08:59:02,000 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-03 08:59:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:02,000 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-03 08:59:02,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 08:59:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-03 08:59:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 08:59:02,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:02,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:02,006 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 08:59:02,202 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 08:59:02,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:02,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-03 08:59:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624948173] [2024-11-03 08:59:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:02,204 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 08:59:02,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:02,209 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 08:59:02,211 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 08:59:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:02,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:02,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:02,327 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 08:59:02,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:02,363 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 08:59:02,363 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624948173] [2024-11-03 08:59:02,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [624948173] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:02,364 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:02,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 08:59:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147284679] [2024-11-03 08:59:02,364 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:02,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:59:02,366 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 08:59:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:02,654 INFO L93 Difference]: Finished difference Result 141 states and 255 transitions. [2024-11-03 08:59:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:59:02,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-03 08:59:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:02,659 INFO L225 Difference]: With dead ends: 141 [2024-11-03 08:59:02,659 INFO L226 Difference]: Without dead ends: 113 [2024-11-03 08:59:02,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:59:02,661 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 154 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:02,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 150 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-03 08:59:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2024-11-03 08:59:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.67) internal successors, (167), 100 states have internal predecessors, (167), 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 08:59:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2024-11-03 08:59:02,680 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 167 transitions. Word has length 12 [2024-11-03 08:59:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 167 transitions. [2024-11-03 08:59:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 08:59:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 167 transitions. [2024-11-03 08:59:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 08:59:02,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:02,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:02,688 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 (3)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:02,882 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 08:59:02,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:02,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-03 08:59:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:02,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734752599] [2024-11-03 08:59:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:02,884 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 08:59:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:02,887 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 08:59:02,889 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 08:59:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:02,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:02,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:02,984 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 08:59:02,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:03,028 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 08:59:03,029 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734752599] [2024-11-03 08:59:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [734752599] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:03,029 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:03,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-03 08:59:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905649402] [2024-11-03 08:59:03,029 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:59:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:03,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:59:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:03,031 INFO L87 Difference]: Start difference. First operand 101 states and 167 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 08:59:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:03,498 INFO L93 Difference]: Finished difference Result 274 states and 490 transitions. [2024-11-03 08:59:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 08:59:03,498 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 14 [2024-11-03 08:59:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:03,500 INFO L225 Difference]: With dead ends: 274 [2024-11-03 08:59:03,500 INFO L226 Difference]: Without dead ends: 229 [2024-11-03 08:59:03,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-03 08:59:03,504 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 793 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:03,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 169 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 08:59:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-03 08:59:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2024-11-03 08:59:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.656084656084656) internal successors, (313), 189 states have internal predecessors, (313), 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 08:59:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 313 transitions. [2024-11-03 08:59:03,528 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 313 transitions. Word has length 14 [2024-11-03 08:59:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:03,528 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 313 transitions. [2024-11-03 08:59:03,528 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 08:59:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 313 transitions. [2024-11-03 08:59:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 08:59:03,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:03,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:03,534 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 08:59:03,730 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 08:59:03,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash -842586557, now seen corresponding path program 1 times [2024-11-03 08:59:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77933623] [2024-11-03 08:59:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:03,732 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 08:59:03,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:03,735 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 08:59:03,736 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 08:59:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:03,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:03,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:03,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:03,819 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77933623] [2024-11-03 08:59:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [77933623] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:03,820 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 08:59:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123778882] [2024-11-03 08:59:03,820 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 08:59:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 08:59:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-03 08:59:03,821 INFO L87 Difference]: Start difference. First operand 190 states and 313 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 08:59:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:04,024 INFO L93 Difference]: Finished difference Result 833 states and 1392 transitions. [2024-11-03 08:59:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 08:59:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 26 [2024-11-03 08:59:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:04,028 INFO L225 Difference]: With dead ends: 833 [2024-11-03 08:59:04,028 INFO L226 Difference]: Without dead ends: 668 [2024-11-03 08:59:04,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-03 08:59:04,032 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 215 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:04,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 127 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-03 08:59:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 419. [2024-11-03 08:59:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5406698564593302) internal successors, (644), 418 states have internal predecessors, (644), 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 08:59:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 644 transitions. [2024-11-03 08:59:04,070 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 644 transitions. Word has length 26 [2024-11-03 08:59:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:04,070 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 644 transitions. [2024-11-03 08:59:04,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 08:59:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 644 transitions. [2024-11-03 08:59:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-03 08:59:04,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:04,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:04,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 (5)] Ended with exit code 0 [2024-11-03 08:59:04,275 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 08:59:04,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:04,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1924928046, now seen corresponding path program 1 times [2024-11-03 08:59:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1368837036] [2024-11-03 08:59:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:04,277 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 08:59:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:04,278 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 08:59:04,279 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 08:59:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:04,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:04,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-03 08:59:04,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-03 08:59:04,354 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:04,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1368837036] [2024-11-03 08:59:04,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1368837036] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:04,354 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 08:59:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886292886] [2024-11-03 08:59:04,354 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:59:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:59:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:04,355 INFO L87 Difference]: Start difference. First operand 419 states and 644 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 08:59:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:04,368 INFO L93 Difference]: Finished difference Result 430 states and 659 transitions. [2024-11-03 08:59:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 08:59:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 28 [2024-11-03 08:59:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:04,370 INFO L225 Difference]: With dead ends: 430 [2024-11-03 08:59:04,370 INFO L226 Difference]: Without dead ends: 227 [2024-11-03 08:59:04,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:04,372 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 08:59:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-03 08:59:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-03 08:59:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4601769911504425) internal successors, (330), 226 states have internal predecessors, (330), 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 08:59:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 330 transitions. [2024-11-03 08:59:04,385 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 330 transitions. Word has length 28 [2024-11-03 08:59:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:04,385 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 330 transitions. [2024-11-03 08:59:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 08:59:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 330 transitions. [2024-11-03 08:59:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-03 08:59:04,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:04,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:04,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-03 08:59:04,591 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 08:59:04,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1899874836, now seen corresponding path program 1 times [2024-11-03 08:59:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783154891] [2024-11-03 08:59:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:04,592 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 08:59:04,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:04,595 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 08:59:04,596 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 08:59:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:04,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 08:59:04,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:04,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:04,678 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783154891] [2024-11-03 08:59:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1783154891] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 08:59:04,678 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 08:59:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-03 08:59:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322951862] [2024-11-03 08:59:04,678 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 08:59:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 08:59:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 08:59:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:04,679 INFO L87 Difference]: Start difference. First operand 227 states and 330 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 08:59:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:04,786 INFO L93 Difference]: Finished difference Result 495 states and 750 transitions. [2024-11-03 08:59:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 08:59:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-03 08:59:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:04,788 INFO L225 Difference]: With dead ends: 495 [2024-11-03 08:59:04,788 INFO L226 Difference]: Without dead ends: 291 [2024-11-03 08:59:04,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 08:59:04,789 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:04,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 62 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-03 08:59:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 279. [2024-11-03 08:59:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.356115107913669) internal successors, (377), 278 states have internal predecessors, (377), 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 08:59:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 377 transitions. [2024-11-03 08:59:04,797 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 377 transitions. Word has length 43 [2024-11-03 08:59:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:04,797 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 377 transitions. [2024-11-03 08:59:04,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 08:59:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 377 transitions. [2024-11-03 08:59:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 08:59:04,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:04,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:04,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-03 08:59:04,998 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-03 08:59:04,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:04,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1296972944, now seen corresponding path program 1 times [2024-11-03 08:59:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663260326] [2024-11-03 08:59:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:05,000 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 08:59:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:05,003 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-03 08:59:05,008 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-03 08:59:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:05,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 08:59:05,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:05,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:05,234 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663260326] [2024-11-03 08:59:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [663260326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:05,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 08:59:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245139093] [2024-11-03 08:59:05,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:05,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:59:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:59:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:05,238 INFO L87 Difference]: Start difference. First operand 279 states and 377 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 08:59:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:05,536 INFO L93 Difference]: Finished difference Result 971 states and 1359 transitions. [2024-11-03 08:59:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-03 08:59:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 44 [2024-11-03 08:59:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:05,540 INFO L225 Difference]: With dead ends: 971 [2024-11-03 08:59:05,540 INFO L226 Difference]: Without dead ends: 715 [2024-11-03 08:59:05,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-03 08:59:05,542 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 271 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:05,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 385 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-03 08:59:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 384. [2024-11-03 08:59:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4308093994778068) internal successors, (548), 383 states have internal predecessors, (548), 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 08:59:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 548 transitions. [2024-11-03 08:59:05,570 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 548 transitions. Word has length 44 [2024-11-03 08:59:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:05,571 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 548 transitions. [2024-11-03 08:59:05,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 08:59:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 548 transitions. [2024-11-03 08:59:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 08:59:05,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:05,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:05,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:59:05,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1555138382, now seen corresponding path program 1 times [2024-11-03 08:59:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194270273] [2024-11-03 08:59:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:05,773 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 08:59:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:05,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:59:05,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-03 08:59:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:05,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 08:59:05,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:05,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:06,031 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194270273] [2024-11-03 08:59:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [194270273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:06,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 08:59:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979419728] [2024-11-03 08:59:06,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:06,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 08:59:06,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 08:59:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-03 08:59:06,036 INFO L87 Difference]: Start difference. First operand 384 states and 548 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 08:59:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:06,307 INFO L93 Difference]: Finished difference Result 1235 states and 1950 transitions. [2024-11-03 08:59:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 08:59:06,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 44 [2024-11-03 08:59:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:06,313 INFO L225 Difference]: With dead ends: 1235 [2024-11-03 08:59:06,313 INFO L226 Difference]: Without dead ends: 871 [2024-11-03 08:59:06,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-03 08:59:06,318 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 238 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:06,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 101 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 08:59:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-03 08:59:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 738. [2024-11-03 08:59:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.474898236092266) internal successors, (1087), 737 states have internal predecessors, (1087), 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 08:59:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1087 transitions. [2024-11-03 08:59:06,365 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1087 transitions. Word has length 44 [2024-11-03 08:59:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:06,366 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1087 transitions. [2024-11-03 08:59:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 08:59:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1087 transitions. [2024-11-03 08:59:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-03 08:59:06,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:06,368 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-03 08:59:06,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:59:06,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:06,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 1 times [2024-11-03 08:59:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:06,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41926297] [2024-11-03 08:59:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:06,570 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 08:59:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:06,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:59:06,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-03 08:59:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:06,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 08:59:06,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-03 08:59:06,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-03 08:59:06,784 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41926297] [2024-11-03 08:59:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [41926297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:06,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-03 08:59:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526588243] [2024-11-03 08:59:06,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:06,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 08:59:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 08:59:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-03 08:59:06,786 INFO L87 Difference]: Start difference. First operand 738 states and 1087 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 08:59:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:07,028 INFO L93 Difference]: Finished difference Result 1790 states and 2518 transitions. [2024-11-03 08:59:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 08:59:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2024-11-03 08:59:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:07,033 INFO L225 Difference]: With dead ends: 1790 [2024-11-03 08:59:07,033 INFO L226 Difference]: Without dead ends: 1075 [2024-11-03 08:59:07,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-03 08:59:07,034 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 200 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:07,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 324 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 08:59:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-03 08:59:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 691. [2024-11-03 08:59:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.4173913043478261) internal successors, (978), 690 states have internal predecessors, (978), 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 08:59:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 978 transitions. [2024-11-03 08:59:07,064 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 978 transitions. Word has length 70 [2024-11-03 08:59:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:07,064 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 978 transitions. [2024-11-03 08:59:07,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 08:59:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 978 transitions. [2024-11-03 08:59:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-03 08:59:07,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:07,066 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:07,069 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 (10)] Ended with exit code 0 [2024-11-03 08:59:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:59:07,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:07,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 2 times [2024-11-03 08:59:07,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031052049] [2024-11-03 08:59:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:07,268 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 08:59:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:07,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:59:07,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-03 08:59:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:07,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-03 08:59:07,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:09,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:11,590 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031052049] [2024-11-03 08:59:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2031052049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:11,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:11,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2024-11-03 08:59:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562450422] [2024-11-03 08:59:11,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-03 08:59:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-03 08:59:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2024-11-03 08:59:11,592 INFO L87 Difference]: Start difference. First operand 691 states and 978 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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 08:59:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 08:59:22,957 INFO L93 Difference]: Finished difference Result 3110 states and 4265 transitions. [2024-11-03 08:59:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-03 08:59:22,958 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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 70 [2024-11-03 08:59:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 08:59:22,965 INFO L225 Difference]: With dead ends: 3110 [2024-11-03 08:59:22,965 INFO L226 Difference]: Without dead ends: 2841 [2024-11-03 08:59:22,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2598, Invalid=14432, Unknown=0, NotChecked=0, Total=17030 [2024-11-03 08:59:22,970 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 2491 mSDsluCounter, 9287 mSDsCounter, 0 mSdLazyCounter, 5685 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 9711 SdHoareTripleChecker+Invalid, 5894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 5685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-03 08:59:22,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 9711 Invalid, 5894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 5685 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-03 08:59:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2024-11-03 08:59:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1392. [2024-11-03 08:59:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1391 states have (on average 1.4593817397555715) internal successors, (2030), 1391 states have internal predecessors, (2030), 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 08:59:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2030 transitions. [2024-11-03 08:59:23,051 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2030 transitions. Word has length 70 [2024-11-03 08:59:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 08:59:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2030 transitions. [2024-11-03 08:59:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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 08:59:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2030 transitions. [2024-11-03 08:59:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-03 08:59:23,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 08:59:23,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 08:59:23,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-03 08:59:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:59:23,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 08:59:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 08:59:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2024-11-03 08:59:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 08:59:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1389667872] [2024-11-03 08:59:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 08:59:23,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 08:59:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 08:59:23,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 08:59:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-03 08:59:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 08:59:23,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-03 08:59:23,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 08:59:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:25,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 08:59:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 08:59:27,619 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 08:59:27,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1389667872] [2024-11-03 08:59:27,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1389667872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 08:59:27,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 08:59:27,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-03 08:59:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882808129] [2024-11-03 08:59:27,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 08:59:27,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-03 08:59:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 08:59:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-03 08:59:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-03 08:59:27,621 INFO L87 Difference]: Start difference. First operand 1392 states and 2030 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:06,927 INFO L93 Difference]: Finished difference Result 6994 states and 9503 transitions. [2024-11-03 09:00:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2024-11-03 09:00:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2024-11-03 09:00:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:06,942 INFO L225 Difference]: With dead ends: 6994 [2024-11-03 09:00:06,942 INFO L226 Difference]: Without dead ends: 6235 [2024-11-03 09:00:06,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24737 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=8496, Invalid=65216, Unknown=0, NotChecked=0, Total=73712 [2024-11-03 09:00:06,952 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 2118 mSDsluCounter, 19205 mSDsCounter, 0 mSdLazyCounter, 12906 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 20026 SdHoareTripleChecker+Invalid, 13234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 12906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:06,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 20026 Invalid, 13234 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [328 Valid, 12906 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-03 09:00:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2024-11-03 09:00:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 3257. [2024-11-03 09:00:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3257 states, 3256 states have (on average 1.452088452088452) internal successors, (4728), 3256 states have internal predecessors, (4728), 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:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4728 transitions. [2024-11-03 09:00:07,170 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4728 transitions. Word has length 74 [2024-11-03 09:00:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:07,171 INFO L471 AbstractCegarLoop]: Abstraction has 3257 states and 4728 transitions. [2024-11-03 09:00:07,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4728 transitions. [2024-11-03 09:00:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-03 09:00:07,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:07,174 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:07,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-03 09:00:07,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:07,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:07,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash -877944922, now seen corresponding path program 1 times [2024-11-03 09:00:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055676297] [2024-11-03 09:00:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:07,378 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:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:07,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:00:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-03 09:00:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:07,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-03 09:00:07,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:09,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:11,565 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055676297] [2024-11-03 09:00:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2055676297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:11,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-03 09:00:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800096823] [2024-11-03 09:00:11,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:11,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-03 09:00:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-03 09:00:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2024-11-03 09:00:11,567 INFO L87 Difference]: Start difference. First operand 3257 states and 4728 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:31,261 INFO L93 Difference]: Finished difference Result 6494 states and 8971 transitions. [2024-11-03 09:00:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-03 09:00:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2024-11-03 09:00:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:31,274 INFO L225 Difference]: With dead ends: 6494 [2024-11-03 09:00:31,275 INFO L226 Difference]: Without dead ends: 5673 [2024-11-03 09:00:31,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5201 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=2489, Invalid=18681, Unknown=0, NotChecked=0, Total=21170 [2024-11-03 09:00:31,278 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1570 mSDsluCounter, 10562 mSDsCounter, 0 mSdLazyCounter, 6686 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 11025 SdHoareTripleChecker+Invalid, 6798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 6686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:31,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 11025 Invalid, 6798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 6686 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-03 09:00:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2024-11-03 09:00:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 3450. [2024-11-03 09:00:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3449 states have (on average 1.449405624818788) internal successors, (4999), 3449 states have internal predecessors, (4999), 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:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4999 transitions. [2024-11-03 09:00:31,513 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4999 transitions. Word has length 74 [2024-11-03 09:00:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:31,513 INFO L471 AbstractCegarLoop]: Abstraction has 3450 states and 4999 transitions. [2024-11-03 09:00:31,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4999 transitions. [2024-11-03 09:00:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-03 09:00:31,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:31,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:31,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-03 09:00:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:31,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 190648999, now seen corresponding path program 1 times [2024-11-03 09:00:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [375452026] [2024-11-03 09:00:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:31,720 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:31,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:31,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:00:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-03 09:00:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:31,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:00:31,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:31,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:31,925 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [375452026] [2024-11-03 09:00:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [375452026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:31,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-03 09:00:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125221630] [2024-11-03 09:00:31,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:31,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-03 09:00:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:31,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-03 09:00:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-03 09:00:31,927 INFO L87 Difference]: Start difference. First operand 3450 states and 4999 transitions. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:32,914 INFO L93 Difference]: Finished difference Result 12196 states and 19344 transitions. [2024-11-03 09:00:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-03 09:00:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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 76 [2024-11-03 09:00:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:32,927 INFO L225 Difference]: With dead ends: 12196 [2024-11-03 09:00:32,928 INFO L226 Difference]: Without dead ends: 5847 [2024-11-03 09:00:32,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-11-03 09:00:32,932 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 322 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:32,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 150 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 09:00:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2024-11-03 09:00:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5244. [2024-11-03 09:00:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 5243 states have (on average 1.2239176044249476) internal successors, (6417), 5243 states have internal predecessors, (6417), 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:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 6417 transitions. [2024-11-03 09:00:33,314 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 6417 transitions. Word has length 76 [2024-11-03 09:00:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:33,314 INFO L471 AbstractCegarLoop]: Abstraction has 5244 states and 6417 transitions. [2024-11-03 09:00:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 6417 transitions. [2024-11-03 09:00:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-03 09:00:33,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:33,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:33,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-03 09:00:33,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:00:33,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:33,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1461199560, now seen corresponding path program 1 times [2024-11-03 09:00:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1385365979] [2024-11-03 09:00:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:33,517 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:33,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:33,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:00:33,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-03 09:00:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:33,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-03 09:00:33,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:36,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:38,938 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1385365979] [2024-11-03 09:00:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1385365979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:38,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-03 09:00:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413023814] [2024-11-03 09:00:38,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:38,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-03 09:00:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-03 09:00:38,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2275, Unknown=0, NotChecked=0, Total=2450 [2024-11-03 09:00:38,939 INFO L87 Difference]: Start difference. First operand 5244 states and 6417 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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)