/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 20:57:52,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 20:57:52,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 20:57:52,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 20:57:52,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 20:57:52,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 20:57:52,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 20:57:52,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 20:57:52,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 20:57:52,229 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 20:57:52,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 20:57:52,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 20:57:52,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 20:57:52,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 20:57:52,232 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 20:57:52,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 20:57:52,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 20:57:52,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 20:57:52,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 20:57:52,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 20:57:52,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 20:57:52,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 20:57:52,234 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 20:57:52,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 20:57:52,234 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 20:57:52,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 20:57:52,235 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 20:57:52,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 20:57:52,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 20:57:52,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 20:57:52,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 20:57:52,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:57:52,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 20:57:52,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 20:57:52,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 20:57:52,238 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 20:57:52,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 20:57:52,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 20:57:52,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 20:57:52,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 20:57:52,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 20:57:52,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 20:57:52,239 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 20:57:52,239 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 [2023-12-16 20:57:52,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 20:57:52,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 20:57:52,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 20:57:52,512 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 20:57:52,512 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 20:57:52,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:53,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 20:57:53,950 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 20:57:53,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:53,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2436690db/7b0031fa51f4486cbb0b7005aabf4936/FLAG31654c80f [2023-12-16 20:57:53,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2436690db/7b0031fa51f4486cbb0b7005aabf4936 [2023-12-16 20:57:53,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 20:57:53,983 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 20:57:53,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 20:57:53,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 20:57:53,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 20:57:53,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:57:53" (1/1) ... [2023-12-16 20:57:53,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c0b04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:53, skipping insertion in model container [2023-12-16 20:57:53,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:57:53" (1/1) ... [2023-12-16 20:57:54,050 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 20:57:54,221 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2023-12-16 20:57:54,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:57:54,414 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 20:57:54,425 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2023-12-16 20:57:54,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:57:54,594 INFO L206 MainTranslator]: Completed translation [2023-12-16 20:57:54,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54 WrapperNode [2023-12-16 20:57:54,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 20:57:54,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 20:57:54,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 20:57:54,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 20:57:54,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,687 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 955 [2023-12-16 20:57:54,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 20:57:54,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 20:57:54,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 20:57:54,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 20:57:54,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,761 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]. [2023-12-16 20:57:54,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 20:57:54,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 20:57:54,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 20:57:54,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 20:57:54,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (1/1) ... [2023-12-16 20:57:54,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:57:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 20:57:54,873 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) [2023-12-16 20:57:54,889 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 [2023-12-16 20:57:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 20:57:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 20:57:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 20:57:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 20:57:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 20:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 20:57:55,117 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 20:57:55,119 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 20:57:55,800 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 20:57:55,854 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 20:57:55,855 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-12-16 20:57:55,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:57:55 BoogieIcfgContainer [2023-12-16 20:57:55,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 20:57:55,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 20:57:55,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 20:57:55,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 20:57:55,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:57:53" (1/3) ... [2023-12-16 20:57:55,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44665a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:57:55, skipping insertion in model container [2023-12-16 20:57:55,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:54" (2/3) ... [2023-12-16 20:57:55,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44665a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:57:55, skipping insertion in model container [2023-12-16 20:57:55,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:57:55" (3/3) ... [2023-12-16 20:57:55,862 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:55,877 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 20:57:55,877 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 20:57:55,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 20:57:55,925 INFO L357 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, mHoare=true, 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;@5f28453b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 20:57:55,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 20:57:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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) [2023-12-16 20:57:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 20:57:55,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:55,935 INFO L195 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] [2023-12-16 20:57:55,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:55,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1253369385, now seen corresponding path program 1 times [2023-12-16 20:57:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:55,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802013732] [2023-12-16 20:57:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:55,955 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 [2023-12-16 20:57:55,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:55,956 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) [2023-12-16 20:57:55,959 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 [2023-12-16 20:57:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:56,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 20:57:56,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 20:57:56,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:56,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802013732] [2023-12-16 20:57:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802013732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 20:57:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238270123] [2023-12-16 20:57:56,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:56,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 20:57:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 20:57:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:57:56,383 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2023-12-16 20:57:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:56,463 INFO L93 Difference]: Finished difference Result 64 states and 106 transitions. [2023-12-16 20:57:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 20:57:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 38 [2023-12-16 20:57:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:56,471 INFO L225 Difference]: With dead ends: 64 [2023-12-16 20:57:56,471 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 20:57:56,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:57:56,477 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:56,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 20:57:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 20:57:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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) [2023-12-16 20:57:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-16 20:57:56,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 38 [2023-12-16 20:57:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:56,518 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-16 20:57:56,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2023-12-16 20:57:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-16 20:57:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 20:57:56,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:56,522 INFO L195 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] [2023-12-16 20:57:56,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:56,727 WARN L477 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 [2023-12-16 20:57:56,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:56,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -511455097, now seen corresponding path program 1 times [2023-12-16 20:57:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966370078] [2023-12-16 20:57:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:56,730 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 [2023-12-16 20:57:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:56,731 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) [2023-12-16 20:57:56,738 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 [2023-12-16 20:57:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:57,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:57,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:57,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:57,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966370078] [2023-12-16 20:57:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966370078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:57,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 20:57:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309279893] [2023-12-16 20:57:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:57,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:57,115 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2023-12-16 20:57:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:57,176 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2023-12-16 20:57:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 38 [2023-12-16 20:57:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:57,179 INFO L225 Difference]: With dead ends: 63 [2023-12-16 20:57:57,179 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 20:57:57,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:57,181 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:57,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 20:57:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-16 20:57:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2023-12-16 20:57:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2023-12-16 20:57:57,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 38 [2023-12-16 20:57:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2023-12-16 20:57:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2023-12-16 20:57:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2023-12-16 20:57:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 20:57:57,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:57,199 INFO L195 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] [2023-12-16 20:57:57,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:57,403 WARN L477 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 [2023-12-16 20:57:57,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:57,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1015111959, now seen corresponding path program 1 times [2023-12-16 20:57:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467433926] [2023-12-16 20:57:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:57,406 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 [2023-12-16 20:57:57,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:57,409 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) [2023-12-16 20:57:57,410 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 [2023-12-16 20:57:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:57,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:57,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:57,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:57,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467433926] [2023-12-16 20:57:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467433926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:57,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-16 20:57:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737106739] [2023-12-16 20:57:57,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:57,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:57,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:57,750 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-12-16 20:57:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:57,859 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-12-16 20:57:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:57:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 39 [2023-12-16 20:57:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:57,860 INFO L225 Difference]: With dead ends: 66 [2023-12-16 20:57:57,860 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 20:57:57,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:57,861 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:57,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 20:57:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-16 20:57:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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) [2023-12-16 20:57:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2023-12-16 20:57:57,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 39 [2023-12-16 20:57:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:57,867 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-12-16 20:57:57,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-12-16 20:57:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2023-12-16 20:57:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 20:57:57,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:57,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:57,876 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 [2023-12-16 20:57:58,073 WARN L477 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 [2023-12-16 20:57:58,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:58,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2091611271, now seen corresponding path program 2 times [2023-12-16 20:57:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105665330] [2023-12-16 20:57:58,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:58,075 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 [2023-12-16 20:57:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:58,077 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) [2023-12-16 20:57:58,079 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 [2023-12-16 20:57:58,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 20:57:58,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:58,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:58,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-16 20:57:58,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:58,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105665330] [2023-12-16 20:57:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105665330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922538424] [2023-12-16 20:57:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:58,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:58,330 INFO L87 Difference]: Start difference. First operand 36 states and 46 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) [2023-12-16 20:57:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:58,390 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-12-16 20:57:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:58,391 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 42 [2023-12-16 20:57:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:58,391 INFO L225 Difference]: With dead ends: 65 [2023-12-16 20:57:58,391 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 20:57:58,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:58,393 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:58,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 20:57:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-16 20:57:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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) [2023-12-16 20:57:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-12-16 20:57:58,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 42 [2023-12-16 20:57:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:58,398 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-12-16 20:57:58,398 INFO L496 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) [2023-12-16 20:57:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-12-16 20:57:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 20:57:58,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:58,399 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-12-16 20:57:58,406 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:58,602 WARN L477 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 [2023-12-16 20:57:58,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:58,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1725283338, now seen corresponding path program 1 times [2023-12-16 20:57:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600332958] [2023-12-16 20:57:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:58,604 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 [2023-12-16 20:57:58,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:58,605 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) [2023-12-16 20:57:58,606 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 [2023-12-16 20:57:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:58,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:57:58,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-16 20:57:58,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-16 20:57:58,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600332958] [2023-12-16 20:57:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600332958] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:58,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:58,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 20:57:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115581149] [2023-12-16 20:57:58,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:58,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:57:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:57:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:57:58,984 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2023-12-16 20:57:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:59,155 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-12-16 20:57:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:57:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 43 [2023-12-16 20:57:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:59,157 INFO L225 Difference]: With dead ends: 72 [2023-12-16 20:57:59,157 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 20:57:59,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:57:59,158 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:59,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 20:57:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-16 20:57:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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) [2023-12-16 20:57:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-12-16 20:57:59,165 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 43 [2023-12-16 20:57:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:59,165 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-12-16 20:57:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2023-12-16 20:57:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-12-16 20:57:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 20:57:59,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:59,168 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 20:57:59,173 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 [2023-12-16 20:57:59,373 WARN L477 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 [2023-12-16 20:57:59,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:59,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2032887798, now seen corresponding path program 2 times [2023-12-16 20:57:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894538924] [2023-12-16 20:57:59,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:59,375 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 [2023-12-16 20:57:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:59,377 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) [2023-12-16 20:57:59,380 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 [2023-12-16 20:57:59,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 20:57:59,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:59,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 20:57:59,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-16 20:57:59,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:59,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894538924] [2023-12-16 20:57:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894538924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:59,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:59,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 20:57:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304697381] [2023-12-16 20:57:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:59,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 20:57:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:59,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 20:57:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 20:57:59,893 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-16 20:58:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:00,198 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-12-16 20:58:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 20:58:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 [2023-12-16 20:58:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:00,200 INFO L225 Difference]: With dead ends: 64 [2023-12-16 20:58:00,200 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 20:58:00,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:00,201 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:00,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 69 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 20:58:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 20:58:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2023-12-16 20:58:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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) [2023-12-16 20:58:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-12-16 20:58:00,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 47 [2023-12-16 20:58:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:00,219 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-12-16 20:58:00,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-16 20:58:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-12-16 20:58:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 20:58:00,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:00,222 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-12-16 20:58:00,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:00,426 WARN L477 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 [2023-12-16 20:58:00,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:00,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1329816324, now seen corresponding path program 1 times [2023-12-16 20:58:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083924895] [2023-12-16 20:58:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:58:00,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 [2023-12-16 20:58:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:00,429 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) [2023-12-16 20:58:00,430 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 [2023-12-16 20:58:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:58:00,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:00,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:58:00,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:58:00,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083924895] [2023-12-16 20:58:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083924895] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:00,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:58:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506345710] [2023-12-16 20:58:00,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:00,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:58:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:58:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:58:00,949 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2023-12-16 20:58:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:01,052 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-12-16 20:58:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:58:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 88 [2023-12-16 20:58:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:01,055 INFO L225 Difference]: With dead ends: 96 [2023-12-16 20:58:01,055 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 20:58:01,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:01,056 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:01,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 20:58:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 20:58:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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) [2023-12-16 20:58:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-12-16 20:58:01,086 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 88 [2023-12-16 20:58:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:01,087 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-12-16 20:58:01,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2023-12-16 20:58:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-12-16 20:58:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 20:58:01,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:01,088 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 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] [2023-12-16 20:58:01,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:01,296 WARN L477 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 [2023-12-16 20:58:01,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:01,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1492819353, now seen corresponding path program 2 times [2023-12-16 20:58:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723307017] [2023-12-16 20:58:01,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:58:01,299 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 [2023-12-16 20:58:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:01,300 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) [2023-12-16 20:58:01,306 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 [2023-12-16 20:58:01,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:58:01,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:01,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:01,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:58:01,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:58:01,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723307017] [2023-12-16 20:58:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723307017] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:01,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011406214] [2023-12-16 20:58:01,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:01,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:01,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:01,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:01,999 INFO L87 Difference]: Start difference. First operand 56 states and 71 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) [2023-12-16 20:58:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:02,155 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2023-12-16 20:58:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:02,156 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 91 [2023-12-16 20:58:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:02,157 INFO L225 Difference]: With dead ends: 100 [2023-12-16 20:58:02,157 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 20:58:02,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:02,158 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:02,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 20:58:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-16 20:58:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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) [2023-12-16 20:58:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2023-12-16 20:58:02,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 91 [2023-12-16 20:58:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:02,171 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2023-12-16 20:58:02,171 INFO L496 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) [2023-12-16 20:58:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2023-12-16 20:58:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 20:58:02,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:02,173 INFO L195 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] [2023-12-16 20:58:02,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:02,387 WARN L477 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 [2023-12-16 20:58:02,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1476439641, now seen corresponding path program 3 times [2023-12-16 20:58:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156051475] [2023-12-16 20:58:02,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:02,390 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 [2023-12-16 20:58:02,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:02,391 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) [2023-12-16 20:58:02,391 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 [2023-12-16 20:58:02,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:58:02,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:02,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:58:02,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:58:02,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:58:02,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156051475] [2023-12-16 20:58:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156051475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:58:02,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:58:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:58:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906571100] [2023-12-16 20:58:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:58:02,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:58:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:58:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:02,930 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2023-12-16 20:58:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:03,011 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2023-12-16 20:58:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:58:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 95 [2023-12-16 20:58:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:03,013 INFO L225 Difference]: With dead ends: 88 [2023-12-16 20:58:03,013 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 20:58:03,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:03,014 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:03,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 20:58:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-16 20:58:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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) [2023-12-16 20:58:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2023-12-16 20:58:03,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 95 [2023-12-16 20:58:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:03,026 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2023-12-16 20:58:03,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2023-12-16 20:58:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2023-12-16 20:58:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 20:58:03,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:03,027 INFO L195 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] [2023-12-16 20:58:03,043 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 [2023-12-16 20:58:03,237 WARN L477 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 [2023-12-16 20:58:03,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:03,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 123081630, now seen corresponding path program 1 times [2023-12-16 20:58:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380302267] [2023-12-16 20:58:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:58:03,239 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 [2023-12-16 20:58:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:03,240 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) [2023-12-16 20:58:03,241 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 [2023-12-16 20:58:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:58:03,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:03,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:58:03,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-12-16 20:58:03,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:03,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380302267] [2023-12-16 20:58:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380302267] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:03,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:58:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350964609] [2023-12-16 20:58:03,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:58:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:58:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:58:03,900 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-12-16 20:58:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:04,042 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2023-12-16 20:58:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:58:04,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 96 [2023-12-16 20:58:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:04,043 INFO L225 Difference]: With dead ends: 92 [2023-12-16 20:58:04,044 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 20:58:04,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:04,045 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:04,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 20:58:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 20:58:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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) [2023-12-16 20:58:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2023-12-16 20:58:04,058 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 96 [2023-12-16 20:58:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:04,058 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2023-12-16 20:58:04,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-12-16 20:58:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2023-12-16 20:58:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 20:58:04,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:04,060 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 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] [2023-12-16 20:58:04,072 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:04,270 WARN L477 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 [2023-12-16 20:58:04,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:04,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash 681285479, now seen corresponding path program 2 times [2023-12-16 20:58:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845113670] [2023-12-16 20:58:04,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:58:04,273 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 [2023-12-16 20:58:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:04,274 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) [2023-12-16 20:58:04,275 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 [2023-12-16 20:58:04,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:58:04,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:04,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:04,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:58:05,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-12-16 20:58:05,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845113670] [2023-12-16 20:58:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845113670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:05,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447997135] [2023-12-16 20:58:05,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:05,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:05,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:05,111 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2023-12-16 20:58:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:05,379 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-12-16 20:58:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 99 [2023-12-16 20:58:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:05,380 INFO L225 Difference]: With dead ends: 99 [2023-12-16 20:58:05,381 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 20:58:05,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:05,382 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:05,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 20:58:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 20:58:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-16 20:58:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 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) [2023-12-16 20:58:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2023-12-16 20:58:05,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 99 [2023-12-16 20:58:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:05,393 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2023-12-16 20:58:05,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2023-12-16 20:58:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2023-12-16 20:58:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 20:58:05,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:05,394 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-12-16 20:58:05,406 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 [2023-12-16 20:58:05,606 WARN L477 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 [2023-12-16 20:58:05,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:05,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -769721049, now seen corresponding path program 3 times [2023-12-16 20:58:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524006560] [2023-12-16 20:58:05,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:05,608 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 [2023-12-16 20:58:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:05,609 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) [2023-12-16 20:58:05,610 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 [2023-12-16 20:58:06,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:58:06,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:06,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:58:06,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-12-16 20:58:06,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:58:06,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524006560] [2023-12-16 20:58:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524006560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:58:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:58:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:58:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969174065] [2023-12-16 20:58:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:58:06,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:58:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:58:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:06,098 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-16 20:58:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:06,170 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2023-12-16 20:58:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:58:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 103 [2023-12-16 20:58:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:06,172 INFO L225 Difference]: With dead ends: 104 [2023-12-16 20:58:06,172 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 20:58:06,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:06,174 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:06,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:58:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 20:58:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-16 20:58:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 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) [2023-12-16 20:58:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2023-12-16 20:58:06,192 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 103 [2023-12-16 20:58:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:06,193 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2023-12-16 20:58:06,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2023-12-16 20:58:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2023-12-16 20:58:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 20:58:06,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:06,197 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-12-16 20:58:06,210 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:06,405 WARN L477 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 [2023-12-16 20:58:06,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:06,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1831878171, now seen corresponding path program 1 times [2023-12-16 20:58:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:06,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109096381] [2023-12-16 20:58:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:58:06,407 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 [2023-12-16 20:58:06,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:06,408 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) [2023-12-16 20:58:06,417 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 [2023-12-16 20:58:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:58:07,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:58:07,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:58:07,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:58:07,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109096381] [2023-12-16 20:58:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109096381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:58:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:58:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:58:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848362448] [2023-12-16 20:58:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:58:07,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:58:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:58:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:07,312 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2023-12-16 20:58:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:07,378 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2023-12-16 20:58:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:58:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 104 [2023-12-16 20:58:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:07,381 INFO L225 Difference]: With dead ends: 106 [2023-12-16 20:58:07,381 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 20:58:07,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:07,382 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:07,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 20:58:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-16 20:58:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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) [2023-12-16 20:58:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-12-16 20:58:07,394 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 104 [2023-12-16 20:58:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:07,395 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-12-16 20:58:07,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2023-12-16 20:58:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-12-16 20:58:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 20:58:07,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:07,396 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-12-16 20:58:07,408 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:07,608 WARN L477 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 [2023-12-16 20:58:07,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:07,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash -492710023, now seen corresponding path program 1 times [2023-12-16 20:58:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754345380] [2023-12-16 20:58:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:58:07,609 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 [2023-12-16 20:58:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:07,611 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) [2023-12-16 20:58:07,612 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 [2023-12-16 20:58:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:58:08,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:08,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:58:08,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-16 20:58:08,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754345380] [2023-12-16 20:58:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754345380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:08,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:58:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505331954] [2023-12-16 20:58:08,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:08,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:58:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:58:08,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:58:08,718 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-12-16 20:58:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:08,836 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2023-12-16 20:58:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:58:08,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 105 [2023-12-16 20:58:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:08,838 INFO L225 Difference]: With dead ends: 110 [2023-12-16 20:58:08,838 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 20:58:08,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:08,839 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:08,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 20:58:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-16 20:58:08,847 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) [2023-12-16 20:58:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-12-16 20:58:08,848 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 105 [2023-12-16 20:58:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:08,848 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-12-16 20:58:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-12-16 20:58:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-12-16 20:58:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 20:58:08,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:08,849 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 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] [2023-12-16 20:58:08,863 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:09,061 WARN L477 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 [2023-12-16 20:58:09,061 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:09,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 24282853, now seen corresponding path program 2 times [2023-12-16 20:58:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210714700] [2023-12-16 20:58:09,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:58:09,063 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 [2023-12-16 20:58:09,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:09,064 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) [2023-12-16 20:58:09,069 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 [2023-12-16 20:58:10,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:58:10,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:10,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:10,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:58:10,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-16 20:58:10,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210714700] [2023-12-16 20:58:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210714700] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:10,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200078875] [2023-12-16 20:58:10,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:10,446 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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) [2023-12-16 20:58:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:10,675 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2023-12-16 20:58:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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 108 [2023-12-16 20:58:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:10,676 INFO L225 Difference]: With dead ends: 117 [2023-12-16 20:58:10,676 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 20:58:10,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:10,677 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:10,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 20:58:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 20:58:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-16 20:58:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 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) [2023-12-16 20:58:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2023-12-16 20:58:10,687 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 108 [2023-12-16 20:58:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:10,687 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2023-12-16 20:58:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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) [2023-12-16 20:58:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2023-12-16 20:58:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 20:58:10,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:10,689 INFO L195 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] [2023-12-16 20:58:10,700 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:10,900 WARN L477 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 [2023-12-16 20:58:10,900 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:10,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 657116133, now seen corresponding path program 3 times [2023-12-16 20:58:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046809435] [2023-12-16 20:58:10,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:10,902 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 [2023-12-16 20:58:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:10,903 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) [2023-12-16 20:58:10,904 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 [2023-12-16 20:58:11,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:58:11,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:11,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:58:11,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:58:11,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:58:11,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046809435] [2023-12-16 20:58:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046809435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:58:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:58:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:58:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022321624] [2023-12-16 20:58:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:58:11,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:58:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:58:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:58:11,380 INFO L87 Difference]: Start difference. First operand 77 states and 92 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) [2023-12-16 20:58:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:11,434 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-12-16 20:58:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:58:11,435 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 [2023-12-16 20:58:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:11,436 INFO L225 Difference]: With dead ends: 122 [2023-12-16 20:58:11,436 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 20:58:11,436 INFO L412 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 [2023-12-16 20:58:11,437 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:11,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:58:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 20:58:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-16 20:58:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 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) [2023-12-16 20:58:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2023-12-16 20:58:11,451 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 112 [2023-12-16 20:58:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:11,452 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2023-12-16 20:58:11,452 INFO L496 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) [2023-12-16 20:58:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2023-12-16 20:58:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 20:58:11,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:11,453 INFO L195 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] [2023-12-16 20:58:11,461 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:11,660 WARN L477 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 [2023-12-16 20:58:11,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:11,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash -727139535, now seen corresponding path program 1 times [2023-12-16 20:58:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:11,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411084135] [2023-12-16 20:58:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:58:11,662 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 [2023-12-16 20:58:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:11,664 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) [2023-12-16 20:58:11,666 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 [2023-12-16 20:58:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:58:12,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:12,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:58:12,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 20:58:12,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:12,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411084135] [2023-12-16 20:58:12,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411084135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:12,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:12,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:58:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423870629] [2023-12-16 20:58:12,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:12,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:58:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:58:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:58:12,841 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2023-12-16 20:58:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:12,946 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2023-12-16 20:58:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:58:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 113 [2023-12-16 20:58:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:12,948 INFO L225 Difference]: With dead ends: 126 [2023-12-16 20:58:12,948 INFO L226 Difference]: Without dead ends: 81 [2023-12-16 20:58:12,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:12,949 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:12,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-16 20:58:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-16 20:58:12,958 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) [2023-12-16 20:58:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2023-12-16 20:58:12,960 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 113 [2023-12-16 20:58:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:12,960 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2023-12-16 20:58:12,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2023-12-16 20:58:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2023-12-16 20:58:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 20:58:12,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:12,961 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 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] [2023-12-16 20:58:12,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:13,164 WARN L477 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 [2023-12-16 20:58:13,165 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:13,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 148794543, now seen corresponding path program 2 times [2023-12-16 20:58:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448773013] [2023-12-16 20:58:13,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:58:13,166 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 [2023-12-16 20:58:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:13,167 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) [2023-12-16 20:58:13,169 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 [2023-12-16 20:58:14,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:58:14,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:14,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:14,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:58:14,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 20:58:14,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448773013] [2023-12-16 20:58:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448773013] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:14,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966086278] [2023-12-16 20:58:14,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:14,826 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 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) [2023-12-16 20:58:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:15,006 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2023-12-16 20:58:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:15,006 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), 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 116 [2023-12-16 20:58:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:15,007 INFO L225 Difference]: With dead ends: 133 [2023-12-16 20:58:15,007 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 20:58:15,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:15,008 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 20:58:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-16 20:58:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 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) [2023-12-16 20:58:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2023-12-16 20:58:15,017 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 116 [2023-12-16 20:58:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:15,017 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2023-12-16 20:58:15,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 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) [2023-12-16 20:58:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2023-12-16 20:58:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 20:58:15,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:15,019 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-12-16 20:58:15,033 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:15,231 WARN L477 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 [2023-12-16 20:58:15,231 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:15,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1213914415, now seen corresponding path program 3 times [2023-12-16 20:58:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:15,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045324589] [2023-12-16 20:58:15,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:15,233 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 [2023-12-16 20:58:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:15,234 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) [2023-12-16 20:58:15,236 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 [2023-12-16 20:58:16,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 20:58:16,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:16,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-16 20:58:16,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2023-12-16 20:58:16,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:16,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045324589] [2023-12-16 20:58:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045324589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 20:58:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949171901] [2023-12-16 20:58:16,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:16,918 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 20:58:16,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 20:58:16,969 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 20:58:16,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-16 20:58:18,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 20:58:18,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:18,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:18,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-16 20:58:18,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-16 20:58:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [949171901] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:18,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 20:58:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2023-12-16 20:58:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899769416] [2023-12-16 20:58:18,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:18,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 20:58:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 20:58:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-12-16 20:58:18,325 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-16 20:58:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:19,440 INFO L93 Difference]: Finished difference Result 226 states and 272 transitions. [2023-12-16 20:58:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 20:58:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 120 [2023-12-16 20:58:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:19,441 INFO L225 Difference]: With dead ends: 226 [2023-12-16 20:58:19,441 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 20:58:19,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 20:58:19,442 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:19,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 240 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 20:58:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 20:58:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2023-12-16 20:58:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.0916666666666666) internal successors, (131), 120 states have internal predecessors, (131), 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) [2023-12-16 20:58:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2023-12-16 20:58:19,464 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 120 [2023-12-16 20:58:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:19,464 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2023-12-16 20:58:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-16 20:58:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2023-12-16 20:58:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-16 20:58:19,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:19,466 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 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] [2023-12-16 20:58:19,478 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:19,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:19,879 WARN L477 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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 20:58:19,879 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:19,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1942986247, now seen corresponding path program 4 times [2023-12-16 20:58:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899199978] [2023-12-16 20:58:19,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 20:58:19,881 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 [2023-12-16 20:58:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:19,897 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) [2023-12-16 20:58:19,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-16 20:58:21,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 20:58:21,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:21,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:21,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 496 proven. 10 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2023-12-16 20:58:22,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 296 proven. 10 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2023-12-16 20:58:22,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899199978] [2023-12-16 20:58:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899199978] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:22,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808020820] [2023-12-16 20:58:22,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:22,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:22,124 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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) [2023-12-16 20:58:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:22,304 INFO L93 Difference]: Finished difference Result 213 states and 258 transitions. [2023-12-16 20:58:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:22,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 192 [2023-12-16 20:58:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:22,306 INFO L225 Difference]: With dead ends: 213 [2023-12-16 20:58:22,306 INFO L226 Difference]: Without dead ends: 145 [2023-12-16 20:58:22,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:22,307 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:22,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-16 20:58:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-12-16 20:58:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 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) [2023-12-16 20:58:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2023-12-16 20:58:22,326 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 192 [2023-12-16 20:58:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:22,326 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2023-12-16 20:58:22,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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) [2023-12-16 20:58:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2023-12-16 20:58:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-16 20:58:22,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:22,329 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 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] [2023-12-16 20:58:22,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:22,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 20:58:22,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:22,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1840648697, now seen corresponding path program 5 times [2023-12-16 20:58:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006822959] [2023-12-16 20:58:22,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 20:58:22,547 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 [2023-12-16 20:58:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:22,548 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 20:58:22,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-16 20:58:41,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-12-16 20:58:41,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:42,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 2266 conjuncts, 214 conjunts are in the unsatisfiable core [2023-12-16 20:58:42,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 72 proven. 401 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-16 20:58:48,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:49,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006822959] [2023-12-16 20:58:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006822959] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 20:58:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [831368675] [2023-12-16 20:58:49,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 20:58:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 20:58:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 20:58:49,204 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 20:58:49,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process Received shutdown request... [2023-12-16 20:59:00,753 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 20:59:00,767 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 20:59:00,777 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 20:59:01,792 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 0 [2023-12-16 20:59:01,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-16 20:59:01,979 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forcibly destroying the process [2023-12-16 20:59:01,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 137 [2023-12-16 20:59:01,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 20:59:01,996 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 20:59:01,996 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 201 with TraceHistMax 16,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleZ3 [449315734]. [2023-12-16 20:59:02,000 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-16 20:59:02,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 20:59:02,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:59:02 BoogieIcfgContainer [2023-12-16 20:59:02,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 20:59:02,004 INFO L158 Benchmark]: Toolchain (without parser) took 68021.42ms. Allocated memory was 178.3MB in the beginning and 571.5MB in the end (delta: 393.2MB). Free memory was 125.9MB in the beginning and 459.9MB in the end (delta: -334.0MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2023-12-16 20:59:02,005 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 20:59:02,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.91ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 125.6MB in the beginning and 254.2MB in the end (delta: -128.6MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2023-12-16 20:59:02,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.41ms. Allocated memory is still 287.3MB. Free memory was 254.2MB in the beginning and 246.3MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 20:59:02,005 INFO L158 Benchmark]: Boogie Preprocessor took 141.58ms. Allocated memory is still 287.3MB. Free memory was 246.3MB in the beginning and 237.4MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-16 20:59:02,005 INFO L158 Benchmark]: RCFGBuilder took 1017.85ms. Allocated memory is still 287.3MB. Free memory was 237.4MB in the beginning and 147.7MB in the end (delta: 89.7MB). Peak memory consumption was 89.1MB. Max. memory is 8.0GB. [2023-12-16 20:59:02,006 INFO L158 Benchmark]: TraceAbstraction took 66146.75ms. Allocated memory was 287.3MB in the beginning and 571.5MB in the end (delta: 284.2MB). Free memory was 147.2MB in the beginning and 459.9MB in the end (delta: -312.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 20:59:02,007 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.11ms. Allocated memory is still 178.3MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 608.91ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 125.6MB in the beginning and 254.2MB in the end (delta: -128.6MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.41ms. Allocated memory is still 287.3MB. Free memory was 254.2MB in the beginning and 246.3MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 141.58ms. Allocated memory is still 287.3MB. Free memory was 246.3MB in the beginning and 237.4MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1017.85ms. Allocated memory is still 287.3MB. Free memory was 237.4MB in the beginning and 147.7MB in the end (delta: 89.7MB). Peak memory consumption was 89.1MB. Max. memory is 8.0GB. * TraceAbstraction took 66146.75ms. Allocated memory was 287.3MB in the beginning and 571.5MB in the end (delta: 284.2MB). Free memory was 147.2MB in the beginning and 459.9MB in the end (delta: -312.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while NwaCegarLoop was analyzing trace of length 201 with TraceHistMax 16,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleZ3 [449315734]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.1s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 2894 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1446 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 660 mSDtfsCounter, 1446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3132 GetRequests, 2988 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=20, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.3s SsaConstructionTime, 9.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3086 ConstructedInterpolants, 0 QuantifiedInterpolants, 4282 SizeOfPredicates, 52 NumberOfNonLiveVariables, 19881 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 9235/9394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown