/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:33:55,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:33:55,138 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-06 05:33:55,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:33:55,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:33:55,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:33:55,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:33:55,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:33:55,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:33:55,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:33:55,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:33:55,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:33:55,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:33:55,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:33:55,171 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:33:55,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:33:55,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:33:55,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:33:55,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:33:55,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:33:55,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:33:55,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:33:55,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:33:55,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:33:55,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:33:55,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:33:55,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:33:55,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:33:55,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:33:55,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:33:55,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:33:55,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:33:55,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:33:55,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:33:55,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:33:55,178 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:33:55,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:33:55,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:33:55,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:33:55,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:33:55,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:33:55,180 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:33:55,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:33:55,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:33:55,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:33:55,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:33:55,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:33:55,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:33:56,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:33:56,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:33:56,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:33:56,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7ca9ad1/dbd28022f2c348b092c0d6b9a54f5830/FLAGf17a8a276 [2024-11-06 05:33:57,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7ca9ad1/dbd28022f2c348b092c0d6b9a54f5830 [2024-11-06 05:33:57,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:33:57,218 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:33:57,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:33:57,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:33:57,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:33:57,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9183b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57, skipping insertion in model container [2024-11-06 05:33:57,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:33:57,404 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.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2024-11-06 05:33:57,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:33:57,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:33:57,633 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.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2024-11-06 05:33:57,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:33:57,820 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:33:57,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57 WrapperNode [2024-11-06 05:33:57,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:33:57,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:33:57,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:33:57,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:33:57,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,918 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 959 [2024-11-06 05:33:57,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:33:57,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:33:57,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:33:57,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:33:57,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:57,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,007 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2024-11-06 05:33:58,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:33:58,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:33:58,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:33:58,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:33:58,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (1/1) ... [2024-11-06 05:33:58,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:33:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:33:58,119 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-06 05:33:58,130 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-06 05:33:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:33:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:33:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:33:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:33:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:33:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-06 05:33:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-06 05:33:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-06 05:33:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:33:58,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:33:58,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:33:59,034 INFO L? ?]: Removed 681 outVars from TransFormulas that were not future-live. [2024-11-06 05:33:59,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:33:59,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:33:59,046 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-06 05:33:59,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:33:59 BoogieIcfgContainer [2024-11-06 05:33:59,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:33:59,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:33:59,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:33:59,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:33:59,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:33:57" (1/3) ... [2024-11-06 05:33:59,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ac7377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:33:59, skipping insertion in model container [2024-11-06 05:33:59,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:33:57" (2/3) ... [2024-11-06 05:33:59,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ac7377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:33:59, skipping insertion in model container [2024-11-06 05:33:59,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:33:59" (3/3) ... [2024-11-06 05:33:59,054 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:33:59,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:33:59,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:33:59,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:33:59,118 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;@755bfd1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:33:59,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:33:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 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-06 05:33:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:33:59,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:33:59,128 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] [2024-11-06 05:33:59,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:33:59,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:33:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1919498836, now seen corresponding path program 1 times [2024-11-06 05:33:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:33:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015945868] [2024-11-06 05:33:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:33:59,150 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-06 05:33:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:33:59,155 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-06 05:33:59,157 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-06 05:33:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:33:59,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:33:59,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:33:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 05:33:59,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:33:59,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:33:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015945868] [2024-11-06 05:33:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015945868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:33:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:33:59,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:33:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608018604] [2024-11-06 05:33:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:33:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:33:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:33:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:33:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:33:59,509 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:33:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:33:59,521 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2024-11-06 05:33:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:33:59,523 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-11-06 05:33:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:33:59,526 INFO L225 Difference]: With dead ends: 77 [2024-11-06 05:33:59,527 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 05:33:59,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-06 05:33:59,530 INFO L432 NwaCegarLoop]: 49 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, 49 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-06 05:33:59,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:33:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 05:33:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 05:33:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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-06 05:33:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-06 05:33:59,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 39 [2024-11-06 05:33:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:33:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-06 05:33:59,554 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:33:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-06 05:33:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:33:59,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:33:59,556 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] [2024-11-06 05:33:59,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 05:33:59,756 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-06 05:33:59,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:33:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:33:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1633554172, now seen corresponding path program 1 times [2024-11-06 05:33:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:33:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788096237] [2024-11-06 05:33:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:33:59,758 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-06 05:33:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:33:59,761 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-06 05:33:59,762 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-06 05:34:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:00,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:00,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:00,105 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-06 05:34:00,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:00,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:00,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788096237] [2024-11-06 05:34:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788096237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:00,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413871882] [2024-11-06 05:34:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:00,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:00,108 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:00,125 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-11-06 05:34:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:00,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2024-11-06 05:34:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:00,127 INFO L225 Difference]: With dead ends: 76 [2024-11-06 05:34:00,127 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 05:34:00,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:00,129 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:00,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 05:34:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-06 05:34:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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-06 05:34:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-06 05:34:00,135 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 39 [2024-11-06 05:34:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:00,135 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-06 05:34:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-06 05:34:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 05:34:00,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:00,136 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-06 05:34:00,142 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-06 05:34:00,340 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-06 05:34:00,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1034306366, now seen corresponding path program 1 times [2024-11-06 05:34:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13737891] [2024-11-06 05:34:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:00,343 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-06 05:34:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:00,345 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-06 05:34:00,348 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-06 05:34:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:00,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:00,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:34:00,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:34:00,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13737891] [2024-11-06 05:34:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13737891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:00,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123344296] [2024-11-06 05:34:00,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:00,670 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-06 05:34:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:00,715 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-11-06 05:34:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 41 [2024-11-06 05:34:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:00,717 INFO L225 Difference]: With dead ends: 81 [2024-11-06 05:34:00,717 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 05:34:00,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:00,720 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:00,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 179 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 05:34:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 05:34:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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-06 05:34:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-06 05:34:00,728 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 41 [2024-11-06 05:34:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:00,728 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-06 05:34:00,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-06 05:34:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-06 05:34:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 05:34:00,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:00,730 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] [2024-11-06 05:34:00,738 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-06 05:34:00,931 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-06 05:34:00,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:00,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1863265540, now seen corresponding path program 2 times [2024-11-06 05:34:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681540758] [2024-11-06 05:34:00,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:00,932 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-06 05:34:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:00,935 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-06 05:34:00,936 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-06 05:34:01,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 05:34:01,173 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:01,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:01,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:01,189 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-06 05:34:01,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:01,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681540758] [2024-11-06 05:34:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681540758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334310222] [2024-11-06 05:34:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:01,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:01,191 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:01,209 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-06 05:34:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-06 05:34:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:01,212 INFO L225 Difference]: With dead ends: 80 [2024-11-06 05:34:01,212 INFO L226 Difference]: Without dead ends: 48 [2024-11-06 05:34:01,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:01,213 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:01,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-06 05:34:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-06 05:34:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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-06 05:34:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-06 05:34:01,221 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 47 [2024-11-06 05:34:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:01,221 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-06 05:34:01,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-06 05:34:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 05:34:01,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:01,222 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-06 05:34:01,231 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-06 05:34:01,426 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-06 05:34:01,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 347467898, now seen corresponding path program 1 times [2024-11-06 05:34:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349117491] [2024-11-06 05:34:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:01,428 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-06 05:34:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:01,432 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-06 05:34:01,445 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-06 05:34:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:01,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:01,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 05:34:01,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 05:34:01,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349117491] [2024-11-06 05:34:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349117491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:01,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385713210] [2024-11-06 05:34:01,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:01,854 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-06 05:34:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:01,967 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2024-11-06 05:34:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-06 05:34:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:01,970 INFO L225 Difference]: With dead ends: 91 [2024-11-06 05:34:01,970 INFO L226 Difference]: Without dead ends: 55 [2024-11-06 05:34:01,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:01,971 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:01,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 311 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-06 05:34:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-06 05:34:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-06 05:34:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-06 05:34:01,977 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 49 [2024-11-06 05:34:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:01,977 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-06 05:34:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-06 05:34:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-06 05:34:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 05:34:01,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:01,982 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 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-06 05:34:01,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-06 05:34:02,185 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-06 05:34:02,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1009564786, now seen corresponding path program 2 times [2024-11-06 05:34:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791538286] [2024-11-06 05:34:02,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:02,189 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-06 05:34:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:02,192 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-06 05:34:02,194 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-06 05:34:02,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 05:34:02,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:02,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 05:34:02,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-06 05:34:03,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:03,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791538286] [2024-11-06 05:34:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791538286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:03,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:34:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834103508] [2024-11-06 05:34:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:34:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:34:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:34:03,029 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:03,230 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-06 05:34:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:34:03,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-11-06 05:34:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:03,231 INFO L225 Difference]: With dead ends: 69 [2024-11-06 05:34:03,231 INFO L226 Difference]: Without dead ends: 67 [2024-11-06 05:34:03,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:03,232 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:03,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 05:34:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-06 05:34:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-06 05:34:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 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-06 05:34:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-11-06 05:34:03,240 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 57 [2024-11-06 05:34:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:03,242 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-11-06 05:34:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-11-06 05:34:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 05:34:03,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:03,243 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 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] [2024-11-06 05:34:03,247 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-06 05:34:03,443 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-06 05:34:03,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:03,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1536287813, now seen corresponding path program 1 times [2024-11-06 05:34:03,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:03,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675792099] [2024-11-06 05:34:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:03,445 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-06 05:34:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:03,448 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-06 05:34:03,449 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-06 05:34:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:04,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:04,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:04,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:04,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675792099] [2024-11-06 05:34:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675792099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:04,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612857854] [2024-11-06 05:34:04,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:04,097 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-06 05:34:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:04,142 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-06 05:34:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 98 [2024-11-06 05:34:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:04,143 INFO L225 Difference]: With dead ends: 117 [2024-11-06 05:34:04,144 INFO L226 Difference]: Without dead ends: 73 [2024-11-06 05:34:04,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:04,145 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:04,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-06 05:34:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-06 05:34:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 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-06 05:34:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2024-11-06 05:34:04,157 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 98 [2024-11-06 05:34:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:04,158 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2024-11-06 05:34:04,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-06 05:34:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2024-11-06 05:34:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-06 05:34:04,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:04,159 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 4, 4, 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] [2024-11-06 05:34:04,172 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-06 05:34:04,359 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-06 05:34:04,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:04,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1495219189, now seen corresponding path program 2 times [2024-11-06 05:34:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041921428] [2024-11-06 05:34:04,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:04,362 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-06 05:34:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:04,365 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-06 05:34:04,366 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-06 05:34:04,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:04,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:04,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:04,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:05,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:05,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041921428] [2024-11-06 05:34:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041921428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:05,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004718452] [2024-11-06 05:34:05,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:05,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:05,116 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-06 05:34:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:05,223 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2024-11-06 05:34:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 104 [2024-11-06 05:34:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:05,228 INFO L225 Difference]: With dead ends: 125 [2024-11-06 05:34:05,228 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 05:34:05,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:05,229 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:05,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 05:34:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-06 05:34:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 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-06 05:34:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-06 05:34:05,250 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 104 [2024-11-06 05:34:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-06 05:34:05,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-06 05:34:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-06 05:34:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 05:34:05,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:05,251 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 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] [2024-11-06 05:34:05,266 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-06 05:34:05,452 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-06 05:34:05,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:05,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1746558445, now seen corresponding path program 3 times [2024-11-06 05:34:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:05,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085918235] [2024-11-06 05:34:05,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:05,454 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-06 05:34:05,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:05,457 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-06 05:34:05,457 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-06 05:34:05,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:05,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:06,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:06,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:06,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:06,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:06,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085918235] [2024-11-06 05:34:06,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085918235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:06,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069939783] [2024-11-06 05:34:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:06,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:06,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:06,017 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:06,050 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2024-11-06 05:34:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-06 05:34:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:06,054 INFO L225 Difference]: With dead ends: 114 [2024-11-06 05:34:06,054 INFO L226 Difference]: Without dead ends: 83 [2024-11-06 05:34:06,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:06,055 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:06,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-06 05:34:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-06 05:34:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 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-06 05:34:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-06 05:34:06,061 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 112 [2024-11-06 05:34:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-06 05:34:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-06 05:34:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 05:34:06,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:06,062 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 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] [2024-11-06 05:34:06,071 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 (10)] Forceful destruction successful, exit code 0 [2024-11-06 05:34:06,263 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-06 05:34:06,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1839362927, now seen corresponding path program 1 times [2024-11-06 05:34:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29874666] [2024-11-06 05:34:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:06,265 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-06 05:34:06,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:06,267 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-06 05:34:06,269 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-06 05:34:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:07,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:07,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:07,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-06 05:34:07,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29874666] [2024-11-06 05:34:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29874666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:07,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115015874] [2024-11-06 05:34:07,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:07,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:07,078 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-06 05:34:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:07,144 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-06 05:34:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 114 [2024-11-06 05:34:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:07,147 INFO L225 Difference]: With dead ends: 120 [2024-11-06 05:34:07,147 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 05:34:07,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:07,148 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:07,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 05:34:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-06 05:34:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 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-06 05:34:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2024-11-06 05:34:07,154 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 114 [2024-11-06 05:34:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:07,155 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2024-11-06 05:34:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-06 05:34:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2024-11-06 05:34:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 05:34:07,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:07,156 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 4, 4, 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] [2024-11-06 05:34:07,169 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-06 05:34:07,356 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-06 05:34:07,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:07,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 513335051, now seen corresponding path program 2 times [2024-11-06 05:34:07,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:07,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815759686] [2024-11-06 05:34:07,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:07,358 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-06 05:34:07,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:07,359 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-06 05:34:07,361 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-06 05:34:08,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:08,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:08,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:08,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:08,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-06 05:34:08,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815759686] [2024-11-06 05:34:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815759686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:08,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372976947] [2024-11-06 05:34:08,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:08,390 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06 05:34:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:08,522 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-11-06 05:34:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:08,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 120 [2024-11-06 05:34:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:08,524 INFO L225 Difference]: With dead ends: 134 [2024-11-06 05:34:08,524 INFO L226 Difference]: Without dead ends: 96 [2024-11-06 05:34:08,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:08,525 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:08,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-06 05:34:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-06 05:34:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 84 states have internal predecessors, (91), 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-06 05:34:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-06 05:34:08,533 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 120 [2024-11-06 05:34:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:08,533 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-06 05:34:08,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06 05:34:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-06 05:34:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 05:34:08,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:08,534 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:08,545 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-06 05:34:08,734 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-06 05:34:08,735 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -291789821, now seen corresponding path program 3 times [2024-11-06 05:34:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038652390] [2024-11-06 05:34:08,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:08,736 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-06 05:34:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:08,739 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-06 05:34:08,740 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-06 05:34:09,401 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:09,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:09,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:09,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:09,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:09,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038652390] [2024-11-06 05:34:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038652390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005316456] [2024-11-06 05:34:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:09,449 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:09,483 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-11-06 05:34:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2024-11-06 05:34:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:09,485 INFO L225 Difference]: With dead ends: 144 [2024-11-06 05:34:09,485 INFO L226 Difference]: Without dead ends: 98 [2024-11-06 05:34:09,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:09,485 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:09,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-06 05:34:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-06 05:34:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 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-06 05:34:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-06 05:34:09,498 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 128 [2024-11-06 05:34:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-06 05:34:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-06 05:34:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-06 05:34:09,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:09,499 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:09,509 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-06 05:34:09,703 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-06 05:34:09,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1747262911, now seen corresponding path program 1 times [2024-11-06 05:34:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749534592] [2024-11-06 05:34:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:09,705 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-06 05:34:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:09,706 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-06 05:34:09,708 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-06 05:34:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:10,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:10,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:10,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-06 05:34:10,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749534592] [2024-11-06 05:34:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749534592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:10,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:10,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412488521] [2024-11-06 05:34:10,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:10,719 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-06 05:34:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:10,790 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2024-11-06 05:34:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 130 [2024-11-06 05:34:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:10,791 INFO L225 Difference]: With dead ends: 150 [2024-11-06 05:34:10,791 INFO L226 Difference]: Without dead ends: 103 [2024-11-06 05:34:10,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:10,792 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:10,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-06 05:34:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-06 05:34:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 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-06 05:34:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2024-11-06 05:34:10,806 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 130 [2024-11-06 05:34:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:10,806 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2024-11-06 05:34:10,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-06 05:34:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2024-11-06 05:34:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 05:34:10,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:10,807 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 4, 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] [2024-11-06 05:34:10,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-06 05:34:11,007 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-06 05:34:11,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1563987963, now seen corresponding path program 2 times [2024-11-06 05:34:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:11,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225536559] [2024-11-06 05:34:11,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:11,009 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-06 05:34:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:11,010 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-06 05:34:11,015 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-06 05:34:12,352 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:12,352 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:12,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:12,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:12,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-06 05:34:12,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225536559] [2024-11-06 05:34:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225536559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:12,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979704905] [2024-11-06 05:34:12,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:12,487 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-06 05:34:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:12,630 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2024-11-06 05:34:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-06 05:34:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:12,632 INFO L225 Difference]: With dead ends: 164 [2024-11-06 05:34:12,632 INFO L226 Difference]: Without dead ends: 111 [2024-11-06 05:34:12,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:12,633 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:12,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 348 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-06 05:34:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-06 05:34:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 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-06 05:34:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-06 05:34:12,639 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 136 [2024-11-06 05:34:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:12,640 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-06 05:34:12,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-06 05:34:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-06 05:34:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 05:34:12,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:12,640 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:12,654 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-06 05:34:12,844 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-06 05:34:12,845 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:12,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash -469367821, now seen corresponding path program 3 times [2024-11-06 05:34:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210373940] [2024-11-06 05:34:12,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:12,846 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-06 05:34:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:12,849 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-06 05:34:12,850 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-06 05:34:13,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:13,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:13,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:13,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:13,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:13,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210373940] [2024-11-06 05:34:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210373940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773679497] [2024-11-06 05:34:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:13,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:13,610 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:13,626 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2024-11-06 05:34:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:13,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 144 [2024-11-06 05:34:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:13,627 INFO L225 Difference]: With dead ends: 174 [2024-11-06 05:34:13,628 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 05:34:13,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:13,628 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:13,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 05:34:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-06 05:34:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.07) internal successors, (107), 100 states have internal predecessors, (107), 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-06 05:34:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2024-11-06 05:34:13,634 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 144 [2024-11-06 05:34:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:13,635 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2024-11-06 05:34:13,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2024-11-06 05:34:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-06 05:34:13,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:13,635 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:13,647 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-06 05:34:13,836 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-06 05:34:13,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2091779569, now seen corresponding path program 1 times [2024-11-06 05:34:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233249917] [2024-11-06 05:34:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:13,837 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-06 05:34:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:13,839 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-06 05:34:13,840 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-06 05:34:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:15,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:15,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:15,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 05:34:15,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233249917] [2024-11-06 05:34:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233249917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:15,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575550265] [2024-11-06 05:34:15,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:15,315 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06 05:34:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:15,360 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2024-11-06 05:34:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 146 [2024-11-06 05:34:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:15,361 INFO L225 Difference]: With dead ends: 180 [2024-11-06 05:34:15,361 INFO L226 Difference]: Without dead ends: 118 [2024-11-06 05:34:15,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:15,362 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:15,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-06 05:34:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-06 05:34:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.0660377358490567) internal successors, (113), 106 states have internal predecessors, (113), 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-06 05:34:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-06 05:34:15,373 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 146 [2024-11-06 05:34:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:15,374 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-06 05:34:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06 05:34:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-06 05:34:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-06 05:34:15,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:15,375 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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] [2024-11-06 05:34:15,390 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-06 05:34:15,575 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-06 05:34:15,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1989517589, now seen corresponding path program 2 times [2024-11-06 05:34:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152817516] [2024-11-06 05:34:15,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:15,577 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-06 05:34:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:15,580 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-06 05:34:15,580 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-06 05:34:17,307 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:17,307 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:17,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:17,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:17,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 05:34:17,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152817516] [2024-11-06 05:34:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152817516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:17,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132097659] [2024-11-06 05:34:17,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:17,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:17,545 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-06 05:34:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:17,650 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2024-11-06 05:34:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-06 05:34:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:17,651 INFO L225 Difference]: With dead ends: 194 [2024-11-06 05:34:17,651 INFO L226 Difference]: Without dead ends: 126 [2024-11-06 05:34:17,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:17,652 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:17,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-06 05:34:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-06 05:34:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 114 states have (on average 1.0614035087719298) internal successors, (121), 114 states have internal predecessors, (121), 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-06 05:34:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2024-11-06 05:34:17,663 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 152 [2024-11-06 05:34:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:17,663 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2024-11-06 05:34:17,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-06 05:34:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2024-11-06 05:34:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-06 05:34:17,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:17,664 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:17,680 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 (18)] Ended with exit code 0 [2024-11-06 05:34:17,864 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-06 05:34:17,865 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1008746979, now seen corresponding path program 3 times [2024-11-06 05:34:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751300118] [2024-11-06 05:34:17,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:17,866 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-06 05:34:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:17,873 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-06 05:34:17,873 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-06 05:34:18,768 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:18,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:18,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:18,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:18,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:18,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:18,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751300118] [2024-11-06 05:34:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751300118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755511639] [2024-11-06 05:34:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:18,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:18,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:18,794 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:18,812 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2024-11-06 05:34:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 160 [2024-11-06 05:34:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:18,813 INFO L225 Difference]: With dead ends: 204 [2024-11-06 05:34:18,813 INFO L226 Difference]: Without dead ends: 128 [2024-11-06 05:34:18,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:18,814 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:18,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-06 05:34:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-06 05:34:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 115 states have (on average 1.0608695652173914) internal successors, (122), 115 states have internal predecessors, (122), 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-06 05:34:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2024-11-06 05:34:18,856 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 160 [2024-11-06 05:34:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:18,856 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2024-11-06 05:34:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2024-11-06 05:34:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-06 05:34:18,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:18,857 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:18,868 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-06 05:34:19,058 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-06 05:34:19,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -277973087, now seen corresponding path program 1 times [2024-11-06 05:34:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882417762] [2024-11-06 05:34:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:19,060 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-06 05:34:19,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:19,062 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-06 05:34:19,063 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-06 05:34:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:20,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:20,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:20,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-06 05:34:20,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:20,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882417762] [2024-11-06 05:34:20,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882417762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:20,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:20,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469789043] [2024-11-06 05:34:20,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:20,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:20,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:20,698 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-06 05:34:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:20,740 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2024-11-06 05:34:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:20,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 162 [2024-11-06 05:34:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:20,741 INFO L225 Difference]: With dead ends: 210 [2024-11-06 05:34:20,741 INFO L226 Difference]: Without dead ends: 133 [2024-11-06 05:34:20,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:20,742 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:20,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-06 05:34:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-06 05:34:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.0578512396694215) internal successors, (128), 121 states have internal predecessors, (128), 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-06 05:34:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2024-11-06 05:34:20,751 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 162 [2024-11-06 05:34:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:20,751 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2024-11-06 05:34:20,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-06 05:34:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2024-11-06 05:34:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-06 05:34:20,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:20,752 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 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] [2024-11-06 05:34:20,767 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-06 05:34:20,952 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-06 05:34:20,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:20,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash -946222117, now seen corresponding path program 2 times [2024-11-06 05:34:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913593697] [2024-11-06 05:34:20,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:20,954 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-06 05:34:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:20,957 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-06 05:34:20,958 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-06 05:34:22,921 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:22,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:22,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:22,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:23,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-06 05:34:23,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913593697] [2024-11-06 05:34:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913593697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:23,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343319192] [2024-11-06 05:34:23,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:23,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:23,137 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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-06 05:34:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:23,254 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2024-11-06 05:34:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:23,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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-06 05:34:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:23,255 INFO L225 Difference]: With dead ends: 224 [2024-11-06 05:34:23,255 INFO L226 Difference]: Without dead ends: 141 [2024-11-06 05:34:23,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:23,256 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:23,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 305 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-06 05:34:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-06 05:34:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 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-06 05:34:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2024-11-06 05:34:23,297 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 168 [2024-11-06 05:34:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2024-11-06 05:34:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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-06 05:34:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2024-11-06 05:34:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-06 05:34:23,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:23,299 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2024-11-06 05:34:23,320 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-06 05:34:23,503 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-06 05:34:23,504 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 197516755, now seen corresponding path program 3 times [2024-11-06 05:34:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848734767] [2024-11-06 05:34:23,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:23,506 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-06 05:34:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:23,507 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-06 05:34:23,509 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-06 05:34:24,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 05:34:24,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:24,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 05:34:24,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-06 05:34:25,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:25,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848734767] [2024-11-06 05:34:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848734767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 05:34:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1923332621] [2024-11-06 05:34:25,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:25,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 05:34:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 05:34:25,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 05:34:25,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-06 05:34:27,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 05:34:27,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:27,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-06 05:34:27,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-06 05:34:29,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1923332621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 05:34:29,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-11-06 05:34:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370613246] [2024-11-06 05:34:29,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:29,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 05:34:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:29,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 05:34:29,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-06 05:34:29,179 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 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) [2024-11-06 05:34:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:29,724 INFO L93 Difference]: Finished difference Result 265 states and 291 transitions. [2024-11-06 05:34:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:34:29,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 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) Word has length 176 [2024-11-06 05:34:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:29,726 INFO L225 Difference]: With dead ends: 265 [2024-11-06 05:34:29,726 INFO L226 Difference]: Without dead ends: 263 [2024-11-06 05:34:29,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-06 05:34:29,727 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:29,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 450 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 05:34:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-06 05:34:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2024-11-06 05:34:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.0526315789473684) internal successors, (220), 209 states have internal predecessors, (220), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 05:34:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 250 transitions. [2024-11-06 05:34:29,745 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 250 transitions. Word has length 176 [2024-11-06 05:34:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:29,746 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 250 transitions. [2024-11-06 05:34:29,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 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) [2024-11-06 05:34:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2024-11-06 05:34:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-06 05:34:29,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:29,747 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:29,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-06 05:34:29,970 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 (22)] Ended with exit code 0 [2024-11-06 05:34:30,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-06 05:34:30,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:30,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1897711676, now seen corresponding path program 4 times [2024-11-06 05:34:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946594483] [2024-11-06 05:34:30,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 05:34:30,151 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-06 05:34:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:30,155 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-06 05:34:30,156 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-06 05:34:39,591 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 05:34:39,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:39,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 2288 conjuncts, 230 conjuncts are in the unsatisfiable core [2024-11-06 05:34:39,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 51 proven. 648 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-06 05:34:49,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:35:05,096 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-06 05:35:05,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:35:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946594483] [2024-11-06 05:35:05,098 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-06 05:35:05,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-06 05:35:05,145 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 (24)] Forceful destruction successful, exit code 0 [2024-11-06 05:35:05,299 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-06 05:35:05,299 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-06 05:35:05,304 INFO L158 Benchmark]: Toolchain (without parser) took 68086.15ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 943.7MB). Free memory was 164.5MB in the beginning and 948.2MB in the end (delta: -783.7MB). Peak memory consumption was 161.0MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,304 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 229.6MB. Free memory is still 181.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 05:35:05,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.27ms. Allocated memory was 229.6MB in the beginning and 310.4MB in the end (delta: 80.7MB). Free memory was 164.5MB in the beginning and 254.6MB in the end (delta: -90.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.45ms. Allocated memory is still 310.4MB. Free memory was 254.6MB in the beginning and 247.3MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,305 INFO L158 Benchmark]: Boogie Preprocessor took 170.10ms. Allocated memory is still 310.4MB. Free memory was 247.3MB in the beginning and 237.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,305 INFO L158 Benchmark]: RCFGBuilder took 956.00ms. Allocated memory is still 310.4MB. Free memory was 237.8MB in the beginning and 204.1MB in the end (delta: 33.8MB). Peak memory consumption was 42.7MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,305 INFO L158 Benchmark]: TraceAbstraction took 66254.50ms. Allocated memory was 310.4MB in the beginning and 1.2GB in the end (delta: 863.0MB). Free memory was 203.5MB in the beginning and 948.2MB in the end (delta: -744.7MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2024-11-06 05:35:05,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 229.6MB. Free memory is still 181.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 602.27ms. Allocated memory was 229.6MB in the beginning and 310.4MB in the end (delta: 80.7MB). Free memory was 164.5MB in the beginning and 254.6MB in the end (delta: -90.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.45ms. Allocated memory is still 310.4MB. Free memory was 254.6MB in the beginning and 247.3MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 170.10ms. Allocated memory is still 310.4MB. Free memory was 247.3MB in the beginning and 237.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 956.00ms. Allocated memory is still 310.4MB. Free memory was 237.8MB in the beginning and 204.1MB in the end (delta: 33.8MB). Peak memory consumption was 42.7MB. Max. memory is 8.0GB. * TraceAbstraction took 66254.50ms. Allocated memory was 310.4MB in the beginning and 1.2GB in the end (delta: 863.0MB). Free memory was 203.5MB in the beginning and 948.2MB in the end (delta: -744.7MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...