/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-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:29:29,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:29:29,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 08:29:29,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:29:29,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:29:29,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:29:29,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:29:29,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:29:29,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:29:29,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:29:29,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:29:29,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:29:29,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:29:29,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:29:29,758 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:29:29,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:29:29,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:29:29,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:29:29,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:29:29,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:29:29,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:29:29,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:29:29,760 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:29:29,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:29:29,761 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:29:29,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:29:29,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:29:29,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:29:29,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:29:29,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:29:29,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:29:29,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:29:29,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:29:29,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:29:29,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:29:29,766 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:29:29,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:29:29,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:29:29,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:29:29,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:29:29,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:29:29,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:29,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:29:30,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:29:30,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:29:30,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:29:30,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:29:30,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2024-11-05 08:29:31,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:29:31,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:29:31,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2024-11-05 08:29:31,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b301fdf07/312ea7e9d6624e37a803f4eb8b34e233/FLAGff6671096 [2024-11-05 08:29:31,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b301fdf07/312ea7e9d6624e37a803f4eb8b34e233 [2024-11-05 08:29:31,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:29:31,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:29:31,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:29:31,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:29:31,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:29:31,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:31" (1/1) ... [2024-11-05 08:29:31,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8e329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:31, skipping insertion in model container [2024-11-05 08:29:31,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:31" (1/1) ... [2024-11-05 08:29:31,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:29:32,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c[1268,1281] [2024-11-05 08:29:32,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:29:32,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:29:32,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c[1268,1281] [2024-11-05 08:29:32,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:29:32,488 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:29:32,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32 WrapperNode [2024-11-05 08:29:32,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:29:32,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:29:32,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:29:32,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:29:32,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,634 INFO L138 Inliner]: procedures = 18, calls = 107, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1594 [2024-11-05 08:29:32,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:29:32,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:29:32,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:29:32,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:29:32,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,765 INFO L175 MemorySlicer]: Split 63 memory accesses to 4 slices as follows [2, 8, 24, 29]. 46 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 30 writes are split as follows [0, 4, 12, 14]. [2024-11-05 08:29:32,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:29:32,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:29:32,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:29:32,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:29:32,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (1/1) ... [2024-11-05 08:29:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:29:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:29:32,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 08:29:32,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 08:29:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:29:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:29:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:29:32,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-05 08:29:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:29:33,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:29:33,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:29:34,422 INFO L? ?]: Removed 1019 outVars from TransFormulas that were not future-live. [2024-11-05 08:29:34,423 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:29:34,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:29:34,438 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-05 08:29:34,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:34 BoogieIcfgContainer [2024-11-05 08:29:34,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:29:34,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:29:34,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:29:34,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:29:34,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:31" (1/3) ... [2024-11-05 08:29:34,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c6fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:34, skipping insertion in model container [2024-11-05 08:29:34,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:32" (2/3) ... [2024-11-05 08:29:34,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c6fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:34, skipping insertion in model container [2024-11-05 08:29:34,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:34" (3/3) ... [2024-11-05 08:29:34,449 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_linked_list_fifo_n2d4.c [2024-11-05 08:29:34,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:29:34,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:29:34,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:29:34,527 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;@5b8c6b96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:29:34,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:29:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 71 states have internal predecessors, (110), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:29:34,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:34,538 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:34,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash -958431594, now seen corresponding path program 1 times [2024-11-05 08:29:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1866960963] [2024-11-05 08:29:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:34,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:34,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:34,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:34,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 08:29:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:35,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:29:35,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:29:35,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:29:35,172 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1866960963] [2024-11-05 08:29:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1866960963] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:35,172 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 08:29:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687674676] [2024-11-05 08:29:35,175 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:35,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:29:35,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:29:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:29:35,202 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 71 states have internal predecessors, (110), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 08:29:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:35,227 INFO L93 Difference]: Finished difference Result 149 states and 237 transitions. [2024-11-05 08:29:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:29:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-05 08:29:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:35,235 INFO L225 Difference]: With dead ends: 149 [2024-11-05 08:29:35,235 INFO L226 Difference]: Without dead ends: 75 [2024-11-05 08:29:35,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-05 08:29:35,241 INFO L432 NwaCegarLoop]: 97 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, 97 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-05 08:29:35,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-05 08:29:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-05 08:29:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 68 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2024-11-05 08:29:35,278 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 41 [2024-11-05 08:29:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:35,279 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2024-11-05 08:29:35,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 08:29:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2024-11-05 08:29:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:29:35,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:35,281 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:35,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:35,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:35,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2099855424, now seen corresponding path program 1 times [2024-11-05 08:29:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731684711] [2024-11-05 08:29:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:35,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:35,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 08:29:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:35,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:35,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:36,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:36,062 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731684711] [2024-11-05 08:29:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [731684711] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:36,066 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077114582] [2024-11-05 08:29:36,066 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:36,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:36,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:36,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:36,070 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:36,116 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2024-11-05 08:29:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 41 [2024-11-05 08:29:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:36,119 INFO L225 Difference]: With dead ends: 149 [2024-11-05 08:29:36,119 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:29:36,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:36,121 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:36,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:29:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-05 08:29:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-05 08:29:36,139 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 41 [2024-11-05 08:29:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-05 08:29:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-05 08:29:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 08:29:36,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:36,142 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-05 08:29:36,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 08:29:36,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:36,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:36,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 963432764, now seen corresponding path program 1 times [2024-11-05 08:29:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:36,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1051727248] [2024-11-05 08:29:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:36,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:36,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:29:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:36,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:36,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:36,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:36,895 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1051727248] [2024-11-05 08:29:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1051727248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:36,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494923371] [2024-11-05 08:29:36,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:36,897 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:36,968 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2024-11-05 08:29:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:29:36,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 45 [2024-11-05 08:29:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:36,972 INFO L225 Difference]: With dead ends: 153 [2024-11-05 08:29:36,972 INFO L226 Difference]: Without dead ends: 82 [2024-11-05 08:29:36,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:36,974 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:36,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 463 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-05 08:29:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-05 08:29:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2024-11-05 08:29:36,981 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 45 [2024-11-05 08:29:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2024-11-05 08:29:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2024-11-05 08:29:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-05 08:29:36,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:36,983 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:36,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:29:37,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:37,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 390562872, now seen corresponding path program 2 times [2024-11-05 08:29:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100638318] [2024-11-05 08:29:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:37,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:37,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 08:29:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:37,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:37,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-05 08:29:37,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-05 08:29:37,655 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100638318] [2024-11-05 08:29:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1100638318] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:37,655 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447810514] [2024-11-05 08:29:37,655 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:37,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:37,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:37,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:37,657 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:37,693 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2024-11-05 08:29:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:37,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 49 [2024-11-05 08:29:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:37,695 INFO L225 Difference]: With dead ends: 153 [2024-11-05 08:29:37,695 INFO L226 Difference]: Without dead ends: 85 [2024-11-05 08:29:37,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:37,697 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:37,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-05 08:29:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-05 08:29:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-05 08:29:37,706 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 49 [2024-11-05 08:29:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:37,706 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-05 08:29:37,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-05 08:29:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-05 08:29:37,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:37,709 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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-05 08:29:37,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 08:29:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:37,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1998153908, now seen corresponding path program 1 times [2024-11-05 08:29:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068911104] [2024-11-05 08:29:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:37,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:37,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 08:29:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:38,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:38,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 08:29:38,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 08:29:38,425 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068911104] [2024-11-05 08:29:38,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068911104] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:38,426 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:38,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983143721] [2024-11-05 08:29:38,426 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:38,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:38,428 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:38,472 INFO L93 Difference]: Finished difference Result 153 states and 196 transitions. [2024-11-05 08:29:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 53 [2024-11-05 08:29:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:38,475 INFO L225 Difference]: With dead ends: 153 [2024-11-05 08:29:38,475 INFO L226 Difference]: Without dead ends: 88 [2024-11-05 08:29:38,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:38,477 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:38,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-05 08:29:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-05 08:29:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2024-11-05 08:29:38,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 53 [2024-11-05 08:29:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:38,486 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2024-11-05 08:29:38,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2024-11-05 08:29:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-05 08:29:38,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:38,487 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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-05 08:29:38,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 08:29:38,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:38,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1928044208, now seen corresponding path program 1 times [2024-11-05 08:29:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865000628] [2024-11-05 08:29:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:38,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:38,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 08:29:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:39,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:39,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 08:29:39,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 08:29:39,266 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865000628] [2024-11-05 08:29:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1865000628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:39,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591331122] [2024-11-05 08:29:39,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:39,269 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:39,358 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2024-11-05 08:29:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:29:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 57 [2024-11-05 08:29:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:39,362 INFO L225 Difference]: With dead ends: 157 [2024-11-05 08:29:39,362 INFO L226 Difference]: Without dead ends: 92 [2024-11-05 08:29:39,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:39,363 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:39,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 641 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-05 08:29:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-05 08:29:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.223529411764706) internal successors, (104), 85 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2024-11-05 08:29:39,371 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 57 [2024-11-05 08:29:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:39,371 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2024-11-05 08:29:39,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2024-11-05 08:29:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-05 08:29:39,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:39,372 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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-05 08:29:39,381 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-05 08:29:39,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:39,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 779777708, now seen corresponding path program 2 times [2024-11-05 08:29:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832963405] [2024-11-05 08:29:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:39,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:39,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:39,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 08:29:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:40,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 08:29:40,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-05 08:29:40,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-05 08:29:41,162 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832963405] [2024-11-05 08:29:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1832963405] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:41,163 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:41,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-05 08:29:41,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768147243] [2024-11-05 08:29:41,163 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:41,165 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:29:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:41,557 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2024-11-05 08:29:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:29:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-11-05 08:29:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:41,558 INFO L225 Difference]: With dead ends: 106 [2024-11-05 08:29:41,559 INFO L226 Difference]: Without dead ends: 104 [2024-11-05 08:29:41,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:41,560 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:41,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 413 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 08:29:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-05 08:29:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-05 08:29:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 92 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-11-05 08:29:41,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 61 [2024-11-05 08:29:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:41,580 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-11-05 08:29:41,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:29:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-11-05 08:29:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 08:29:41,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:41,582 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:41,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 08:29:41,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:41,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -466492681, now seen corresponding path program 1 times [2024-11-05 08:29:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394750431] [2024-11-05 08:29:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:41,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:41,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:41,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 08:29:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:42,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:42,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-05 08:29:42,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-05 08:29:42,915 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394750431] [2024-11-05 08:29:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1394750431] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:42,915 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71279721] [2024-11-05 08:29:42,915 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:42,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:42,918 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:42,956 INFO L93 Difference]: Finished difference Result 171 states and 219 transitions. [2024-11-05 08:29:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-05 08:29:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:42,962 INFO L225 Difference]: With dead ends: 171 [2024-11-05 08:29:42,962 INFO L226 Difference]: Without dead ends: 107 [2024-11-05 08:29:42,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:42,963 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:42,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-05 08:29:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-05 08:29:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2) internal successors, (114), 95 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2024-11-05 08:29:42,984 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 124 [2024-11-05 08:29:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:42,984 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2024-11-05 08:29:42,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2024-11-05 08:29:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-05 08:29:42,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:42,986 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:43,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 (9)] Ended with exit code 0 [2024-11-05 08:29:43,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:43,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 57551859, now seen corresponding path program 1 times [2024-11-05 08:29:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990878097] [2024-11-05 08:29:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:43,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:43,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 08:29:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:44,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:44,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-05 08:29:44,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-05 08:29:44,305 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990878097] [2024-11-05 08:29:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990878097] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:44,305 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978440154] [2024-11-05 08:29:44,305 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:44,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:44,307 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:44,347 INFO L93 Difference]: Finished difference Result 177 states and 225 transitions. [2024-11-05 08:29:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-05 08:29:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:44,350 INFO L225 Difference]: With dead ends: 177 [2024-11-05 08:29:44,350 INFO L226 Difference]: Without dead ends: 110 [2024-11-05 08:29:44,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:44,351 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:44,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-05 08:29:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-05 08:29:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 98 states have internal predecessors, (117), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2024-11-05 08:29:44,360 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 128 [2024-11-05 08:29:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2024-11-05 08:29:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2024-11-05 08:29:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 08:29:44,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:44,362 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:44,381 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-05 08:29:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:44,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:44,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1200629359, now seen corresponding path program 1 times [2024-11-05 08:29:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800385812] [2024-11-05 08:29:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:44,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:44,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:44,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:44,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 08:29:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:45,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:45,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-05 08:29:45,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-05 08:29:45,977 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800385812] [2024-11-05 08:29:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [800385812] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:45,977 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574462807] [2024-11-05 08:29:45,978 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:45,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:45,981 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:46,034 INFO L93 Difference]: Finished difference Result 183 states and 231 transitions. [2024-11-05 08:29:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-05 08:29:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:46,038 INFO L225 Difference]: With dead ends: 183 [2024-11-05 08:29:46,038 INFO L226 Difference]: Without dead ends: 113 [2024-11-05 08:29:46,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:46,039 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:46,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-05 08:29:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-05 08:29:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.188118811881188) internal successors, (120), 101 states have internal predecessors, (120), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2024-11-05 08:29:46,048 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 132 [2024-11-05 08:29:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:46,048 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2024-11-05 08:29:46,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2024-11-05 08:29:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-05 08:29:46,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:46,050 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:46,073 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-05 08:29:46,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:46,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 197194347, now seen corresponding path program 1 times [2024-11-05 08:29:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621470488] [2024-11-05 08:29:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:46,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:46,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:46,255 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:46,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:29:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:47,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:47,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-05 08:29:47,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-05 08:29:47,662 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621470488] [2024-11-05 08:29:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1621470488] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:47,662 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16125412] [2024-11-05 08:29:47,663 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:47,664 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:47,708 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2024-11-05 08:29:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-05 08:29:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:47,711 INFO L225 Difference]: With dead ends: 189 [2024-11-05 08:29:47,711 INFO L226 Difference]: Without dead ends: 116 [2024-11-05 08:29:47,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:47,712 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:47,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-05 08:29:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-05 08:29:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.1826923076923077) internal successors, (123), 104 states have internal predecessors, (123), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2024-11-05 08:29:47,724 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 136 [2024-11-05 08:29:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:47,725 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2024-11-05 08:29:47,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2024-11-05 08:29:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-05 08:29:47,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:47,727 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:47,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:47,928 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:47,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash -275664921, now seen corresponding path program 1 times [2024-11-05 08:29:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1927440677] [2024-11-05 08:29:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:47,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:47,930 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:47,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:29:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:49,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:49,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-05 08:29:49,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-05 08:29:49,419 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:49,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1927440677] [2024-11-05 08:29:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1927440677] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:49,419 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:49,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:49,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799155348] [2024-11-05 08:29:49,420 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:49,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:49,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:49,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:49,421 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:49,472 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2024-11-05 08:29:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2024-11-05 08:29:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:49,475 INFO L225 Difference]: With dead ends: 195 [2024-11-05 08:29:49,475 INFO L226 Difference]: Without dead ends: 119 [2024-11-05 08:29:49,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:49,476 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:49,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-05 08:29:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-05 08:29:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 107 states have internal predecessors, (126), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-11-05 08:29:49,488 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 140 [2024-11-05 08:29:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-11-05 08:29:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-11-05 08:29:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-05 08:29:49,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:49,490 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:49,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-05 08:29:49,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:49,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:49,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2131001629, now seen corresponding path program 1 times [2024-11-05 08:29:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761625997] [2024-11-05 08:29:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:49,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:49,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 08:29:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:51,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:51,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-05 08:29:51,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-05 08:29:51,268 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761625997] [2024-11-05 08:29:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1761625997] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:51,268 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567322712] [2024-11-05 08:29:51,268 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:51,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:51,272 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:51,339 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2024-11-05 08:29:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:51,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2024-11-05 08:29:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:51,344 INFO L225 Difference]: With dead ends: 201 [2024-11-05 08:29:51,344 INFO L226 Difference]: Without dead ends: 122 [2024-11-05 08:29:51,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:51,345 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:51,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-05 08:29:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-05 08:29:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 110 states have (on average 1.1727272727272726) internal successors, (129), 110 states have internal predecessors, (129), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-05 08:29:51,356 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 144 [2024-11-05 08:29:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-05 08:29:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-05 08:29:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-05 08:29:51,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:51,358 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:51,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-05 08:29:51,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:51,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:51,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1717534559, now seen corresponding path program 1 times [2024-11-05 08:29:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134544893] [2024-11-05 08:29:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:51,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:51,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:51,562 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:51,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 08:29:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:53,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:53,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-05 08:29:53,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-05 08:29:53,283 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [134544893] [2024-11-05 08:29:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [134544893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:53,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:53,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395162762] [2024-11-05 08:29:53,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:53,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:53,285 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:53,388 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2024-11-05 08:29:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:29:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 148 [2024-11-05 08:29:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:53,394 INFO L225 Difference]: With dead ends: 208 [2024-11-05 08:29:53,394 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 08:29:53,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:53,395 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:53,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 459 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 08:29:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-05 08:29:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 114 states have internal predecessors, (133), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2024-11-05 08:29:53,408 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 148 [2024-11-05 08:29:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:53,408 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2024-11-05 08:29:53,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2024-11-05 08:29:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-05 08:29:53,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:53,409 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:53,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-05 08:29:53,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:53,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 9888219, now seen corresponding path program 2 times [2024-11-05 08:29:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273732361] [2024-11-05 08:29:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:53,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:53,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:53,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 08:29:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:55,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:55,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-05 08:29:55,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-05 08:29:55,857 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273732361] [2024-11-05 08:29:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1273732361] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:55,857 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514307441] [2024-11-05 08:29:55,858 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:55,859 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:55,896 INFO L93 Difference]: Finished difference Result 215 states and 263 transitions. [2024-11-05 08:29:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:55,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 152 [2024-11-05 08:29:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:55,899 INFO L225 Difference]: With dead ends: 215 [2024-11-05 08:29:55,899 INFO L226 Difference]: Without dead ends: 129 [2024-11-05 08:29:55,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:55,900 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:55,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-05 08:29:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-05 08:29:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 117 states have internal predecessors, (136), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2024-11-05 08:29:55,909 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 152 [2024-11-05 08:29:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2024-11-05 08:29:55,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2024-11-05 08:29:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-05 08:29:55,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:55,911 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:55,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-05 08:29:56,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:56,116 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 454071767, now seen corresponding path program 1 times [2024-11-05 08:29:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210535377] [2024-11-05 08:29:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:56,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:56,120 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-05 08:29:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:58,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:58,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-05 08:29:58,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-05 08:29:58,575 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210535377] [2024-11-05 08:29:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1210535377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:58,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751454954] [2024-11-05 08:29:58,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:58,577 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:58,676 INFO L93 Difference]: Finished difference Result 222 states and 270 transitions. [2024-11-05 08:29:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:29:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 156 [2024-11-05 08:29:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:58,680 INFO L225 Difference]: With dead ends: 222 [2024-11-05 08:29:58,680 INFO L226 Difference]: Without dead ends: 133 [2024-11-05 08:29:58,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:58,681 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:58,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-05 08:29:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-05 08:29:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.1570247933884297) internal successors, (140), 121 states have internal predecessors, (140), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-05 08:29:58,693 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 156 [2024-11-05 08:29:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-05 08:29:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2024-11-05 08:29:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-05 08:29:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:58,695 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:58,722 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 (17)] Ended with exit code 0 [2024-11-05 08:29:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:58,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash 962063315, now seen corresponding path program 2 times [2024-11-05 08:29:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213140019] [2024-11-05 08:29:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:58,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:29:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:58,899 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:29:58,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-05 08:30:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:01,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:01,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:30:01,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-05 08:30:01,230 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213140019] [2024-11-05 08:30:01,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [213140019] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:01,230 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129523169] [2024-11-05 08:30:01,231 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:01,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:01,234 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:01,267 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2024-11-05 08:30:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:01,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2024-11-05 08:30:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:01,270 INFO L225 Difference]: With dead ends: 229 [2024-11-05 08:30:01,270 INFO L226 Difference]: Without dead ends: 136 [2024-11-05 08:30:01,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:01,271 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:01,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-05 08:30:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-05 08:30:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.153225806451613) internal successors, (143), 124 states have internal predecessors, (143), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2024-11-05 08:30:01,280 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 160 [2024-11-05 08:30:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:01,280 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2024-11-05 08:30:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2024-11-05 08:30:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-05 08:30:01,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:01,282 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:01,310 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 (18)] Forceful destruction successful, exit code 0 [2024-11-05 08:30:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:01,483 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:01,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1846430897, now seen corresponding path program 1 times [2024-11-05 08:30:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601498782] [2024-11-05 08:30:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:01,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:01,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:01,485 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:01,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-05 08:30:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:03,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:03,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:30:03,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-05 08:30:04,039 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601498782] [2024-11-05 08:30:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1601498782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:04,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:04,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741846578] [2024-11-05 08:30:04,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:04,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:04,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:04,041 INFO L87 Difference]: Start difference. First operand 136 states and 163 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:04,114 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2024-11-05 08:30:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2024-11-05 08:30:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:04,117 INFO L225 Difference]: With dead ends: 236 [2024-11-05 08:30:04,117 INFO L226 Difference]: Without dead ends: 140 [2024-11-05 08:30:04,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:04,118 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:04,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:30:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-05 08:30:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-05 08:30:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.1484375) internal successors, (147), 128 states have internal predecessors, (147), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2024-11-05 08:30:04,128 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 164 [2024-11-05 08:30:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:04,129 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2024-11-05 08:30:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2024-11-05 08:30:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-05 08:30:04,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:04,130 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:04,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-05 08:30:04,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:04,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:04,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -249340725, now seen corresponding path program 2 times [2024-11-05 08:30:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232466529] [2024-11-05 08:30:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:04,333 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:04,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-05 08:30:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:06,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:06,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-05 08:30:06,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-05 08:30:06,962 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:06,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232466529] [2024-11-05 08:30:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [232466529] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:06,962 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:06,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473899049] [2024-11-05 08:30:06,962 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:06,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:06,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:06,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:06,964 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:07,001 INFO L93 Difference]: Finished difference Result 243 states and 291 transitions. [2024-11-05 08:30:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:07,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2024-11-05 08:30:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:07,004 INFO L225 Difference]: With dead ends: 243 [2024-11-05 08:30:07,004 INFO L226 Difference]: Without dead ends: 143 [2024-11-05 08:30:07,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:07,005 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:07,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-05 08:30:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-05 08:30:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 131 states have internal predecessors, (150), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2024-11-05 08:30:07,014 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 168 [2024-11-05 08:30:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:07,014 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2024-11-05 08:30:07,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2024-11-05 08:30:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-05 08:30:07,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:07,016 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:07,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-05 08:30:07,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:07,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1686083527, now seen corresponding path program 1 times [2024-11-05 08:30:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393702738] [2024-11-05 08:30:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:07,223 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:07,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-05 08:30:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:09,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:09,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-05 08:30:10,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-05 08:30:10,070 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:10,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393702738] [2024-11-05 08:30:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [393702738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:10,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836996118] [2024-11-05 08:30:10,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:10,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:10,072 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:10,147 INFO L93 Difference]: Finished difference Result 250 states and 298 transitions. [2024-11-05 08:30:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2024-11-05 08:30:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:10,151 INFO L225 Difference]: With dead ends: 250 [2024-11-05 08:30:10,151 INFO L226 Difference]: Without dead ends: 147 [2024-11-05 08:30:10,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:10,153 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:10,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:30:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-05 08:30:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-05 08:30:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 135 states have (on average 1.1407407407407408) internal successors, (154), 135 states have internal predecessors, (154), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2024-11-05 08:30:10,168 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 172 [2024-11-05 08:30:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:10,168 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2024-11-05 08:30:10,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2024-11-05 08:30:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-05 08:30:10,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:10,171 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:10,193 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 (21)] Forceful destruction successful, exit code 0 [2024-11-05 08:30:10,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:10,372 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:10,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 151909571, now seen corresponding path program 2 times [2024-11-05 08:30:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416387681] [2024-11-05 08:30:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:10,376 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:10,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-05 08:30:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:13,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:13,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-05 08:30:13,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-05 08:30:13,434 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416387681] [2024-11-05 08:30:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [416387681] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:13,434 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435792787] [2024-11-05 08:30:13,434 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:13,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:13,435 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:13,474 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2024-11-05 08:30:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 176 [2024-11-05 08:30:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:13,481 INFO L225 Difference]: With dead ends: 257 [2024-11-05 08:30:13,481 INFO L226 Difference]: Without dead ends: 150 [2024-11-05 08:30:13,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:13,482 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:13,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-05 08:30:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-05 08:30:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2024-11-05 08:30:13,499 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 176 [2024-11-05 08:30:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:13,499 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2024-11-05 08:30:13,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2024-11-05 08:30:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-05 08:30:13,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:13,501 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:13,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-05 08:30:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:13,706 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -848886977, now seen corresponding path program 1 times [2024-11-05 08:30:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:13,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632274011] [2024-11-05 08:30:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:13,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:13,710 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:13,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-05 08:30:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:16,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:16,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-05 08:30:16,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-05 08:30:16,883 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632274011] [2024-11-05 08:30:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1632274011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:16,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612657920] [2024-11-05 08:30:16,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:16,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:16,885 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:16,973 INFO L93 Difference]: Finished difference Result 264 states and 312 transitions. [2024-11-05 08:30:16,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 180 [2024-11-05 08:30:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:16,976 INFO L225 Difference]: With dead ends: 264 [2024-11-05 08:30:16,976 INFO L226 Difference]: Without dead ends: 154 [2024-11-05 08:30:16,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:16,977 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:16,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:30:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-05 08:30:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-05 08:30:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 142 states have internal predecessors, (161), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2024-11-05 08:30:16,987 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 180 [2024-11-05 08:30:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:16,988 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2024-11-05 08:30:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2024-11-05 08:30:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-05 08:30:16,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:16,989 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:17,018 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 (23)] Forceful destruction successful, exit code 0 [2024-11-05 08:30:17,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:17,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:17,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429765, now seen corresponding path program 2 times [2024-11-05 08:30:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:17,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431382428] [2024-11-05 08:30:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:17,192 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-05 08:30:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:20,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:20,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-05 08:30:20,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-05 08:30:20,452 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431382428] [2024-11-05 08:30:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1431382428] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:20,453 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934698475] [2024-11-05 08:30:20,453 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:20,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:20,454 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:20,492 INFO L93 Difference]: Finished difference Result 271 states and 319 transitions. [2024-11-05 08:30:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:20,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 184 [2024-11-05 08:30:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:20,495 INFO L225 Difference]: With dead ends: 271 [2024-11-05 08:30:20,495 INFO L226 Difference]: Without dead ends: 157 [2024-11-05 08:30:20,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:20,496 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:20,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-05 08:30:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-05 08:30:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 145 states have (on average 1.1310344827586207) internal successors, (164), 145 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2024-11-05 08:30:20,510 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 184 [2024-11-05 08:30:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:20,511 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2024-11-05 08:30:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2024-11-05 08:30:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-05 08:30:20,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:20,512 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:20,547 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 (24)] Ended with exit code 0 [2024-11-05 08:30:20,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:20,713 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 881112503, now seen corresponding path program 1 times [2024-11-05 08:30:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779165326] [2024-11-05 08:30:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:20,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:20,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:20,715 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:20,716 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 (25)] Waiting until timeout for monitored process [2024-11-05 08:30:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:24,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:24,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-05 08:30:24,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-05 08:30:24,226 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779165326] [2024-11-05 08:30:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [779165326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:24,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504044444] [2024-11-05 08:30:24,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:24,229 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:24,292 INFO L93 Difference]: Finished difference Result 278 states and 326 transitions. [2024-11-05 08:30:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 188 [2024-11-05 08:30:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:24,294 INFO L225 Difference]: With dead ends: 278 [2024-11-05 08:30:24,294 INFO L226 Difference]: Without dead ends: 161 [2024-11-05 08:30:24,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:24,295 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:24,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:30:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-05 08:30:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-05 08:30:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 149 states have (on average 1.1275167785234899) internal successors, (168), 149 states have internal predecessors, (168), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2024-11-05 08:30:24,305 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 188 [2024-11-05 08:30:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:24,305 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2024-11-05 08:30:24,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2024-11-05 08:30:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-05 08:30:24,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:24,307 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:24,332 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 (25)] Ended with exit code 0 [2024-11-05 08:30:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:24,512 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1383884365, now seen corresponding path program 2 times [2024-11-05 08:30:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236966456] [2024-11-05 08:30:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:24,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:24,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:24,514 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:24,515 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 (26)] Waiting until timeout for monitored process [2024-11-05 08:30:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:28,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:28,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-05 08:30:28,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-05 08:30:28,123 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236966456] [2024-11-05 08:30:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [236966456] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:28,123 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083097210] [2024-11-05 08:30:28,123 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:28,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:28,125 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:28,152 INFO L93 Difference]: Finished difference Result 285 states and 333 transitions. [2024-11-05 08:30:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 192 [2024-11-05 08:30:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:28,154 INFO L225 Difference]: With dead ends: 285 [2024-11-05 08:30:28,155 INFO L226 Difference]: Without dead ends: 164 [2024-11-05 08:30:28,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:28,156 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:28,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-05 08:30:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-05 08:30:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.125) internal successors, (171), 152 states have internal predecessors, (171), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2024-11-05 08:30:28,166 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 192 [2024-11-05 08:30:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:28,166 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2024-11-05 08:30:28,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2024-11-05 08:30:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-05 08:30:28,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:28,167 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:28,195 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 (26)] Ended with exit code 0 [2024-11-05 08:30:28,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:28,368 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1159368913, now seen corresponding path program 1 times [2024-11-05 08:30:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349904842] [2024-11-05 08:30:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:28,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:28,370 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:28,371 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 (27)] Waiting until timeout for monitored process [2024-11-05 08:30:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:32,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:32,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-05 08:30:32,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-05 08:30:32,245 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349904842] [2024-11-05 08:30:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1349904842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:32,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685906262] [2024-11-05 08:30:32,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:32,247 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:32,310 INFO L93 Difference]: Finished difference Result 292 states and 340 transitions. [2024-11-05 08:30:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:32,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 196 [2024-11-05 08:30:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:32,313 INFO L225 Difference]: With dead ends: 292 [2024-11-05 08:30:32,313 INFO L226 Difference]: Without dead ends: 168 [2024-11-05 08:30:32,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:32,314 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:32,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:30:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-05 08:30:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-05 08:30:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 156 states have (on average 1.1217948717948718) internal successors, (175), 156 states have internal predecessors, (175), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2024-11-05 08:30:32,350 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 196 [2024-11-05 08:30:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:32,350 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2024-11-05 08:30:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2024-11-05 08:30:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-05 08:30:32,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:32,352 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:32,380 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 (27)] Ended with exit code 0 [2024-11-05 08:30:32,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:32,552 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -265804117, now seen corresponding path program 2 times [2024-11-05 08:30:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1926085172] [2024-11-05 08:30:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:32,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:32,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:32,554 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:32,555 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 (28)] Waiting until timeout for monitored process [2024-11-05 08:30:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:36,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:36,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-05 08:30:36,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-05 08:30:36,560 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:36,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1926085172] [2024-11-05 08:30:36,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1926085172] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:36,560 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:36,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:36,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702625774] [2024-11-05 08:30:36,560 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:36,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:36,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:36,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:36,562 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:36,591 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2024-11-05 08:30:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 200 [2024-11-05 08:30:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:36,593 INFO L225 Difference]: With dead ends: 299 [2024-11-05 08:30:36,593 INFO L226 Difference]: Without dead ends: 171 [2024-11-05 08:30:36,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:36,594 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:36,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-05 08:30:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-05 08:30:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.119496855345912) internal successors, (178), 159 states have internal predecessors, (178), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2024-11-05 08:30:36,607 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 200 [2024-11-05 08:30:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2024-11-05 08:30:36,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2024-11-05 08:30:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-05 08:30:36,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:36,608 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:36,642 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 (28)] Ended with exit code 0 [2024-11-05 08:30:36,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:36,809 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash -960106585, now seen corresponding path program 1 times [2024-11-05 08:30:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:36,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274185329] [2024-11-05 08:30:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:36,811 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:36,812 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 (29)] Waiting until timeout for monitored process [2024-11-05 08:30:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:40,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:40,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-05 08:30:40,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-05 08:30:41,001 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274185329] [2024-11-05 08:30:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [274185329] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:41,001 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636904366] [2024-11-05 08:30:41,001 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:41,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:41,003 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:41,034 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2024-11-05 08:30:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:41,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 204 [2024-11-05 08:30:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:41,037 INFO L225 Difference]: With dead ends: 305 [2024-11-05 08:30:41,037 INFO L226 Difference]: Without dead ends: 174 [2024-11-05 08:30:41,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:41,037 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:41,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-05 08:30:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-05 08:30:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 162 states have (on average 1.117283950617284) internal successors, (181), 162 states have internal predecessors, (181), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2024-11-05 08:30:41,048 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 204 [2024-11-05 08:30:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2024-11-05 08:30:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2024-11-05 08:30:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-05 08:30:41,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:41,049 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:41,076 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 (29)] Ended with exit code 0 [2024-11-05 08:30:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:41,250 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1004530211, now seen corresponding path program 1 times [2024-11-05 08:30:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648976434] [2024-11-05 08:30:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:41,252 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:41,253 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 (30)] Waiting until timeout for monitored process [2024-11-05 08:30:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:45,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:45,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-05 08:30:45,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-05 08:30:45,643 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648976434] [2024-11-05 08:30:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [648976434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:45,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047392683] [2024-11-05 08:30:45,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:45,645 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:45,709 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2024-11-05 08:30:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 208 [2024-11-05 08:30:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:45,712 INFO L225 Difference]: With dead ends: 312 [2024-11-05 08:30:45,712 INFO L226 Difference]: Without dead ends: 178 [2024-11-05 08:30:45,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:45,713 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:45,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 459 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-05 08:30:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-05 08:30:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 166 states have (on average 1.1144578313253013) internal successors, (185), 166 states have internal predecessors, (185), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-11-05 08:30:45,727 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 208 [2024-11-05 08:30:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:45,727 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-11-05 08:30:45,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-11-05 08:30:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-05 08:30:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:45,728 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:45,760 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 (30)] Ended with exit code 0 [2024-11-05 08:30:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:45,933 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1178617503, now seen corresponding path program 2 times [2024-11-05 08:30:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1024438495] [2024-11-05 08:30:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:45,937 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:45,938 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 (31)] Waiting until timeout for monitored process [2024-11-05 08:30:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:50,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:30:50,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-05 08:30:50,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-05 08:30:50,283 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1024438495] [2024-11-05 08:30:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1024438495] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:30:50,283 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:30:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:30:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513498939] [2024-11-05 08:30:50,284 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:30:50,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:30:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:30:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:50,285 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:50,313 INFO L93 Difference]: Finished difference Result 319 states and 367 transitions. [2024-11-05 08:30:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:30:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 212 [2024-11-05 08:30:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:50,317 INFO L225 Difference]: With dead ends: 319 [2024-11-05 08:30:50,318 INFO L226 Difference]: Without dead ends: 181 [2024-11-05 08:30:50,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:30:50,319 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:50,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-05 08:30:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-05 08:30:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 169 states have (on average 1.1124260355029585) internal successors, (188), 169 states have internal predecessors, (188), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2024-11-05 08:30:50,334 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 212 [2024-11-05 08:30:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2024-11-05 08:30:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2024-11-05 08:30:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-05 08:30:50,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:50,336 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:50,369 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 (31)] Forceful destruction successful, exit code 0 [2024-11-05 08:30:50,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:50,539 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1868237669, now seen corresponding path program 1 times [2024-11-05 08:30:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854369384] [2024-11-05 08:30:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:50,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:50,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:50,541 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:50,542 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 (32)] Waiting until timeout for monitored process [2024-11-05 08:30:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:30:55,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:30:55,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-05 08:30:55,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:30:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-05 08:30:55,084 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:30:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854369384] [2024-11-05 08:30:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1854369384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:30:55,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:30:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:30:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765769916] [2024-11-05 08:30:55,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:30:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:30:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:30:55,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:30:55,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:55,086 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:30:55,138 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2024-11-05 08:30:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:30:55,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 216 [2024-11-05 08:30:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:30:55,141 INFO L225 Difference]: With dead ends: 326 [2024-11-05 08:30:55,141 INFO L226 Difference]: Without dead ends: 185 [2024-11-05 08:30:55,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:30:55,142 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:30:55,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 368 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:30:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-05 08:30:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-05 08:30:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 173 states have (on average 1.1098265895953756) internal successors, (192), 173 states have internal predecessors, (192), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:30:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2024-11-05 08:30:55,156 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 216 [2024-11-05 08:30:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:30:55,156 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2024-11-05 08:30:55,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:30:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2024-11-05 08:30:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-05 08:30:55,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:30:55,158 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:30:55,192 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 (32)] Ended with exit code 0 [2024-11-05 08:30:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:55,359 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:30:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:30:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1664465769, now seen corresponding path program 2 times [2024-11-05 08:30:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:30:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178035977] [2024-11-05 08:30:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:30:55,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:30:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:30:55,363 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:30:55,364 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 (33)] Waiting until timeout for monitored process [2024-11-05 08:31:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:31:00,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 1816 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-05 08:31:00,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:31:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-05 08:31:01,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:31:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-05 08:31:04,531 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:31:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178035977] [2024-11-05 08:31:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [178035977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:31:04,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:31:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-05 08:31:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105487478] [2024-11-05 08:31:04,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:31:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:31:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:31:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:31:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:31:04,533 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand has 19 states, 17 states have (on average 10.941176470588236) internal successors, (186), 19 states have internal predecessors, (186), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)