/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-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:38:33,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:38:34,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:38:34,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:38:34,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:38:34,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:38:34,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:38:34,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:38:34,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:38:34,036 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:38:34,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:38:34,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:38:34,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:38:34,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:38:34,037 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:38:34,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:38:34,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:38:34,038 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:38:34,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:38:34,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:38:34,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:38:34,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:38:34,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:38:34,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:38:34,040 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:38:34,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:38:34,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:38:34,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:38:34,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:38:34,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:38:34,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:38:34,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:38:34,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:38:34,042 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:38:34,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:38:34,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:38:34,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:38:34,043 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:38:34,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:38:34,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:38:34,043 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:38:34,043 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-25 07:38:34,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:38:34,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:38:34,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:38:34,249 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:38:34,251 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:38:34,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-12-25 07:38:35,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:38:35,677 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:38:35,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-12-25 07:38:35,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42093efad/d1a9bc5044db4326bebcd387b664edf2/FLAG7166da144 [2023-12-25 07:38:35,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42093efad/d1a9bc5044db4326bebcd387b664edf2 [2023-12-25 07:38:35,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:38:35,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:38:35,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:38:35,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:38:35,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:38:35,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6aaf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35, skipping insertion in model container [2023-12-25 07:38:35,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,722 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:38:35,899 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2023-12-25 07:38:35,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:38:35,909 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:38:35,934 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2023-12-25 07:38:35,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:38:35,945 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:38:35,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35 WrapperNode [2023-12-25 07:38:35,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:38:35,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:38:35,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:38:35,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:38:35,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,975 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2023-12-25 07:38:35,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:38:35,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:38:35,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:38:35,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:38:35,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:38:35,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:35,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:38:36,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:38:36,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:38:36,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:38:36,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (1/1) ... [2023-12-25 07:38:36,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:38:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:38:36,043 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-25 07:38:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:38:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:38:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:38:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:38:36,061 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-25 07:38:36,126 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:38:36,128 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:38:36,348 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:38:36,374 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:38:36,374 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:38:36,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:38:36 BoogieIcfgContainer [2023-12-25 07:38:36,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:38:36,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:38:36,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:38:36,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:38:36,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:38:35" (1/3) ... [2023-12-25 07:38:36,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8273d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:38:36, skipping insertion in model container [2023-12-25 07:38:36,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:38:35" (2/3) ... [2023-12-25 07:38:36,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8273d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:38:36, skipping insertion in model container [2023-12-25 07:38:36,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:38:36" (3/3) ... [2023-12-25 07:38:36,380 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-12-25 07:38:36,402 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:38:36,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:38:36,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:38:36,440 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;@2be6fb94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:38:36,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:38:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:38:36,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:36,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:36,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:36,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash -417268953, now seen corresponding path program 1 times [2023-12-25 07:38:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262582576] [2023-12-25 07:38:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:36,461 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-25 07:38:36,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:36,464 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-25 07:38:36,465 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-25 07:38:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:36,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:38:36,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:36,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:36,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262582576] [2023-12-25 07:38:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262582576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:38:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663869032] [2023-12-25 07:38:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:36,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:38:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:38:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:38:36,571 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:36,604 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2023-12-25 07:38:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:38:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-25 07:38:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:36,611 INFO L225 Difference]: With dead ends: 83 [2023-12-25 07:38:36,611 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 07:38:36,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-25 07:38:36,616 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:36,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 07:38:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-25 07:38:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2023-12-25 07:38:36,639 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 16 [2023-12-25 07:38:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:36,639 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2023-12-25 07:38:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2023-12-25 07:38:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:38:36,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:36,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:36,645 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-25 07:38:36,842 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-25 07:38:36,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:36,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1004074967, now seen corresponding path program 1 times [2023-12-25 07:38:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060346937] [2023-12-25 07:38:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:36,855 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-25 07:38:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:36,863 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-25 07:38:36,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:38:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:36,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:38:36,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:36,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:36,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060346937] [2023-12-25 07:38:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060346937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:36,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:38:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724017185] [2023-12-25 07:38:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:36,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:38:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:38:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:38:36,969 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:37,030 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2023-12-25 07:38:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:38:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-25 07:38:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:37,032 INFO L225 Difference]: With dead ends: 110 [2023-12-25 07:38:37,032 INFO L226 Difference]: Without dead ends: 78 [2023-12-25 07:38:37,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:38:37,034 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:37,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-25 07:38:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2023-12-25 07:38:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-12-25 07:38:37,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2023-12-25 07:38:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:37,045 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-12-25 07:38:37,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-12-25 07:38:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 07:38:37,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:37,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:37,056 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-25 07:38:37,251 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-25 07:38:37,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:37,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash 871528204, now seen corresponding path program 1 times [2023-12-25 07:38:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911588681] [2023-12-25 07:38:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:37,254 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-25 07:38:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:37,255 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-25 07:38:37,257 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-25 07:38:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:37,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:38:37,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:37,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:37,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:37,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911588681] [2023-12-25 07:38:37,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911588681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:37,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:37,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:38:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946481929] [2023-12-25 07:38:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:37,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:38:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:38:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:38:37,544 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:37,641 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2023-12-25 07:38:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:38:37,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-25 07:38:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:37,646 INFO L225 Difference]: With dead ends: 165 [2023-12-25 07:38:37,646 INFO L226 Difference]: Without dead ends: 136 [2023-12-25 07:38:37,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:38:37,649 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:37,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 253 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:38:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-25 07:38:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2023-12-25 07:38:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.5) internal successors, (153), 102 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2023-12-25 07:38:37,658 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 31 [2023-12-25 07:38:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:37,658 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2023-12-25 07:38:37,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2023-12-25 07:38:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:38:37,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:37,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:37,671 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 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:38:37,864 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-25 07:38:37,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:37,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -739726020, now seen corresponding path program 1 times [2023-12-25 07:38:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958958950] [2023-12-25 07:38:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:37,868 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-25 07:38:37,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:37,869 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-25 07:38:37,870 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-25 07:38:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:37,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:37,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:37,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:37,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958958950] [2023-12-25 07:38:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958958950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440534903] [2023-12-25 07:38:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:37,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:37,948 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:37,963 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2023-12-25 07:38:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-25 07:38:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:37,965 INFO L225 Difference]: With dead ends: 253 [2023-12-25 07:38:37,965 INFO L226 Difference]: Without dead ends: 170 [2023-12-25 07:38:37,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-25 07:38:37,966 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-25 07:38:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2023-12-25 07:38:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 167 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2023-12-25 07:38:37,976 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 33 [2023-12-25 07:38:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:37,976 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2023-12-25 07:38:37,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2023-12-25 07:38:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:38:37,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:37,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:37,982 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-25 07:38:38,179 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-25 07:38:38,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:38,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1404220512, now seen corresponding path program 1 times [2023-12-25 07:38:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:38,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522803009] [2023-12-25 07:38:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:38,181 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-25 07:38:38,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:38,182 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-25 07:38:38,186 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-25 07:38:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:38,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:38:38,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:38,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:38,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522803009] [2023-12-25 07:38:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522803009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:38,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:38:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513672717] [2023-12-25 07:38:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:38:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:38,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:38:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:38:38,264 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:38,287 INFO L93 Difference]: Finished difference Result 182 states and 269 transitions. [2023-12-25 07:38:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:38:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-25 07:38:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:38,289 INFO L225 Difference]: With dead ends: 182 [2023-12-25 07:38:38,289 INFO L226 Difference]: Without dead ends: 180 [2023-12-25 07:38:38,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:38:38,290 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:38,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-25 07:38:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2023-12-25 07:38:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.48) internal successors, (259), 175 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 259 transitions. [2023-12-25 07:38:38,301 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 259 transitions. Word has length 34 [2023-12-25 07:38:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:38,301 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 259 transitions. [2023-12-25 07:38:38,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 259 transitions. [2023-12-25 07:38:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:38:38,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:38,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:38,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:38:38,510 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-25 07:38:38,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:38,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1768252524, now seen corresponding path program 1 times [2023-12-25 07:38:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283243966] [2023-12-25 07:38:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:38,512 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-25 07:38:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:38,513 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-25 07:38:38,514 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-25 07:38:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:38,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:38,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:38,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:38,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283243966] [2023-12-25 07:38:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283243966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:38,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944698155] [2023-12-25 07:38:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:38,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:38,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:38,593 INFO L87 Difference]: Start difference. First operand 176 states and 259 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:38,605 INFO L93 Difference]: Finished difference Result 344 states and 519 transitions. [2023-12-25 07:38:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:38:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:38,607 INFO L225 Difference]: With dead ends: 344 [2023-12-25 07:38:38,607 INFO L226 Difference]: Without dead ends: 255 [2023-12-25 07:38:38,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 07:38:38,608 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:38,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-25 07:38:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2023-12-25 07:38:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4880952380952381) internal successors, (375), 252 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 375 transitions. [2023-12-25 07:38:38,616 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 375 transitions. Word has length 35 [2023-12-25 07:38:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:38,616 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 375 transitions. [2023-12-25 07:38:38,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 375 transitions. [2023-12-25 07:38:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:38:38,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:38,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:38,621 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-25 07:38:38,819 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-25 07:38:38,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:38,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1901058708, now seen corresponding path program 1 times [2023-12-25 07:38:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693735402] [2023-12-25 07:38:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:38,820 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-25 07:38:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:38,821 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-25 07:38:38,848 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-25 07:38:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:38,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:38,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:38,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:38,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693735402] [2023-12-25 07:38:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693735402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612508136] [2023-12-25 07:38:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:38,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:38,890 INFO L87 Difference]: Start difference. First operand 253 states and 375 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:38,911 INFO L93 Difference]: Finished difference Result 679 states and 1018 transitions. [2023-12-25 07:38:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:38:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:38,913 INFO L225 Difference]: With dead ends: 679 [2023-12-25 07:38:38,913 INFO L226 Difference]: Without dead ends: 448 [2023-12-25 07:38:38,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 07:38:38,914 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:38,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-25 07:38:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2023-12-25 07:38:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4719101123595506) internal successors, (655), 445 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 655 transitions. [2023-12-25 07:38:38,928 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 655 transitions. Word has length 35 [2023-12-25 07:38:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:38,929 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 655 transitions. [2023-12-25 07:38:38,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 655 transitions. [2023-12-25 07:38:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:38:38,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:38,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:38,945 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-25 07:38:39,132 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-25 07:38:39,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:39,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1505175148, now seen corresponding path program 1 times [2023-12-25 07:38:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812259707] [2023-12-25 07:38:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:39,134 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-25 07:38:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:39,137 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-25 07:38:39,138 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-25 07:38:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:39,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:39,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:39,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:39,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812259707] [2023-12-25 07:38:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812259707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629415894] [2023-12-25 07:38:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:39,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:39,205 INFO L87 Difference]: Start difference. First operand 446 states and 655 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:39,250 INFO L93 Difference]: Finished difference Result 1222 states and 1795 transitions. [2023-12-25 07:38:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:38:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:39,253 INFO L225 Difference]: With dead ends: 1222 [2023-12-25 07:38:39,253 INFO L226 Difference]: Without dead ends: 798 [2023-12-25 07:38:39,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 07:38:39,254 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:39,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2023-12-25 07:38:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2023-12-25 07:38:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.4377358490566037) internal successors, (1143), 795 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1143 transitions. [2023-12-25 07:38:39,267 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1143 transitions. Word has length 35 [2023-12-25 07:38:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:39,268 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1143 transitions. [2023-12-25 07:38:39,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1143 transitions. [2023-12-25 07:38:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 07:38:39,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:39,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:39,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 07:38:39,471 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-25 07:38:39,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:39,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash -217205247, now seen corresponding path program 1 times [2023-12-25 07:38:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:39,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675202285] [2023-12-25 07:38:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:39,473 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-25 07:38:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:39,475 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-25 07:38:39,478 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-25 07:38:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:39,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:38:39,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:40,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:40,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675202285] [2023-12-25 07:38:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675202285] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:40,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:38:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767156075] [2023-12-25 07:38:40,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:40,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:38:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:38:40,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:38:40,309 INFO L87 Difference]: Start difference. First operand 796 states and 1143 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:41,307 INFO L93 Difference]: Finished difference Result 2514 states and 3588 transitions. [2023-12-25 07:38:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 07:38:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-25 07:38:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:41,312 INFO L225 Difference]: With dead ends: 2514 [2023-12-25 07:38:41,312 INFO L226 Difference]: Without dead ends: 1960 [2023-12-25 07:38:41,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-25 07:38:41,314 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 668 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:41,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 542 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:38:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2023-12-25 07:38:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1568. [2023-12-25 07:38:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4365028717294193) internal successors, (2251), 1567 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2251 transitions. [2023-12-25 07:38:41,375 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2251 transitions. Word has length 49 [2023-12-25 07:38:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:41,375 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2251 transitions. [2023-12-25 07:38:41,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2251 transitions. [2023-12-25 07:38:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 07:38:41,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:41,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:41,381 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-25 07:38:41,579 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-25 07:38:41,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:41,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash -842861311, now seen corresponding path program 1 times [2023-12-25 07:38:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:41,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228400608] [2023-12-25 07:38:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:41,580 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-25 07:38:41,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:41,581 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-25 07:38:41,604 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-25 07:38:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:41,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:41,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:41,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:41,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:41,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228400608] [2023-12-25 07:38:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228400608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:41,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084843952] [2023-12-25 07:38:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:41,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:41,643 INFO L87 Difference]: Start difference. First operand 1568 states and 2251 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:41,676 INFO L93 Difference]: Finished difference Result 2690 states and 3888 transitions. [2023-12-25 07:38:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-25 07:38:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:41,680 INFO L225 Difference]: With dead ends: 2690 [2023-12-25 07:38:41,680 INFO L226 Difference]: Without dead ends: 1144 [2023-12-25 07:38:41,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-25 07:38:41,682 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:41,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-12-25 07:38:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1137. [2023-12-25 07:38:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.4330985915492958) internal successors, (1628), 1136 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1628 transitions. [2023-12-25 07:38:41,713 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1628 transitions. Word has length 49 [2023-12-25 07:38:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:41,713 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1628 transitions. [2023-12-25 07:38:41,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1628 transitions. [2023-12-25 07:38:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 07:38:41,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:41,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:41,718 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-25 07:38:41,916 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-25 07:38:41,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:41,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1927076031, now seen corresponding path program 1 times [2023-12-25 07:38:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465808011] [2023-12-25 07:38:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:41,917 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-25 07:38:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:41,918 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-25 07:38:41,922 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-25 07:38:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:41,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:41,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:41,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:41,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:41,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465808011] [2023-12-25 07:38:41,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465808011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:41,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:41,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280144760] [2023-12-25 07:38:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:41,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:41,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:41,988 INFO L87 Difference]: Start difference. First operand 1137 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:42,005 INFO L93 Difference]: Finished difference Result 1693 states and 2428 transitions. [2023-12-25 07:38:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:42,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-25 07:38:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:42,009 INFO L225 Difference]: With dead ends: 1693 [2023-12-25 07:38:42,009 INFO L226 Difference]: Without dead ends: 587 [2023-12-25 07:38:42,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-25 07:38:42,010 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:42,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-12-25 07:38:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2023-12-25 07:38:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4006849315068493) internal successors, (818), 584 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 818 transitions. [2023-12-25 07:38:42,023 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 818 transitions. Word has length 51 [2023-12-25 07:38:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:42,023 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 818 transitions. [2023-12-25 07:38:42,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 818 transitions. [2023-12-25 07:38:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:38:42,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:42,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:42,025 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-25 07:38:42,225 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-25 07:38:42,226 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:42,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash 174207316, now seen corresponding path program 1 times [2023-12-25 07:38:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663808446] [2023-12-25 07:38:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:42,226 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-25 07:38:42,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:42,227 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-25 07:38:42,231 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-25 07:38:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:42,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:38:42,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:42,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:42,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663808446] [2023-12-25 07:38:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663808446] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:42,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:38:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516783596] [2023-12-25 07:38:42,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:42,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:38:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:38:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:38:42,819 INFO L87 Difference]: Start difference. First operand 585 states and 818 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:43,174 INFO L93 Difference]: Finished difference Result 1179 states and 1649 transitions. [2023-12-25 07:38:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:38:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-25 07:38:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:43,177 INFO L225 Difference]: With dead ends: 1179 [2023-12-25 07:38:43,177 INFO L226 Difference]: Without dead ends: 625 [2023-12-25 07:38:43,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-25 07:38:43,178 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 177 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:43,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 283 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:38:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-25 07:38:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 599. [2023-12-25 07:38:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.394648829431438) internal successors, (834), 598 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 834 transitions. [2023-12-25 07:38:43,192 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 834 transitions. Word has length 52 [2023-12-25 07:38:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:43,193 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 834 transitions. [2023-12-25 07:38:43,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 834 transitions. [2023-12-25 07:38:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 07:38:43,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:43,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:43,198 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-25 07:38:43,398 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-25 07:38:43,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:43,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1009209312, now seen corresponding path program 1 times [2023-12-25 07:38:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260560519] [2023-12-25 07:38:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:43,399 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-25 07:38:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:43,400 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-25 07:38:43,401 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-25 07:38:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:43,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:38:43,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:43,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:38:43,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260560519] [2023-12-25 07:38:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260560519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:38:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:38:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:38:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227862198] [2023-12-25 07:38:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:38:43,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:38:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:38:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:38:43,469 INFO L87 Difference]: Start difference. First operand 599 states and 834 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:43,481 INFO L93 Difference]: Finished difference Result 879 states and 1226 transitions. [2023-12-25 07:38:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:38:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-25 07:38:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:43,483 INFO L225 Difference]: With dead ends: 879 [2023-12-25 07:38:43,483 INFO L226 Difference]: Without dead ends: 325 [2023-12-25 07:38:43,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-25 07:38:43,484 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:43,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-25 07:38:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2023-12-25 07:38:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.3416149068322982) internal successors, (432), 322 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 432 transitions. [2023-12-25 07:38:43,492 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 432 transitions. Word has length 54 [2023-12-25 07:38:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:43,492 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 432 transitions. [2023-12-25 07:38:43,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 432 transitions. [2023-12-25 07:38:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 07:38:43,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:43,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:43,496 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-25 07:38:43,694 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-25 07:38:43,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:43,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -547962027, now seen corresponding path program 1 times [2023-12-25 07:38:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:43,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666677113] [2023-12-25 07:38:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:43,695 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-25 07:38:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:43,696 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-25 07:38:43,700 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-25 07:38:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:43,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:38:43,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:44,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:44,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666677113] [2023-12-25 07:38:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666677113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:44,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:38:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449090057] [2023-12-25 07:38:44,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:44,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:38:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:38:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:38:44,283 INFO L87 Difference]: Start difference. First operand 323 states and 432 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:44,892 INFO L93 Difference]: Finished difference Result 873 states and 1175 transitions. [2023-12-25 07:38:44,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 07:38:44,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-25 07:38:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:44,894 INFO L225 Difference]: With dead ends: 873 [2023-12-25 07:38:44,894 INFO L226 Difference]: Without dead ends: 595 [2023-12-25 07:38:44,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:38:44,895 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 331 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:44,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 441 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:38:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-25 07:38:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 531. [2023-12-25 07:38:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.3283018867924528) internal successors, (704), 530 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 704 transitions. [2023-12-25 07:38:44,910 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 704 transitions. Word has length 55 [2023-12-25 07:38:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:44,910 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 704 transitions. [2023-12-25 07:38:44,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 704 transitions. [2023-12-25 07:38:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 07:38:44,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:44,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:44,915 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-25 07:38:45,113 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-25 07:38:45,113 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:45,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 143425325, now seen corresponding path program 1 times [2023-12-25 07:38:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074956638] [2023-12-25 07:38:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:45,114 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-25 07:38:45,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:45,115 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-25 07:38:45,116 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-25 07:38:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:45,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:38:45,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:38:45,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:38:45,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074956638] [2023-12-25 07:38:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074956638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:45,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:38:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729127263] [2023-12-25 07:38:45,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:38:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:38:45,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:38:45,271 INFO L87 Difference]: Start difference. First operand 531 states and 704 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:45,320 INFO L93 Difference]: Finished difference Result 1479 states and 1945 transitions. [2023-12-25 07:38:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:38:45,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-25 07:38:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:45,322 INFO L225 Difference]: With dead ends: 1479 [2023-12-25 07:38:45,322 INFO L226 Difference]: Without dead ends: 993 [2023-12-25 07:38:45,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:38:45,323 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:45,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:38:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2023-12-25 07:38:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 937. [2023-12-25 07:38:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.2553418803418803) internal successors, (1175), 936 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1175 transitions. [2023-12-25 07:38:45,347 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1175 transitions. Word has length 57 [2023-12-25 07:38:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:45,347 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1175 transitions. [2023-12-25 07:38:45,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1175 transitions. [2023-12-25 07:38:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-25 07:38:45,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:45,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:45,353 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-25 07:38:45,550 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-25 07:38:45,551 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:45,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash -187964122, now seen corresponding path program 1 times [2023-12-25 07:38:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777767130] [2023-12-25 07:38:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:45,551 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-25 07:38:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:45,553 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-25 07:38:45,553 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-25 07:38:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:45,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:38:45,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:46,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:46,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777767130] [2023-12-25 07:38:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777767130] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:46,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:38:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565246276] [2023-12-25 07:38:46,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:46,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:38:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:38:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:38:46,752 INFO L87 Difference]: Start difference. First operand 937 states and 1175 transitions. Second operand has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:47,700 INFO L93 Difference]: Finished difference Result 1525 states and 1930 transitions. [2023-12-25 07:38:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 07:38:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-12-25 07:38:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:47,704 INFO L225 Difference]: With dead ends: 1525 [2023-12-25 07:38:47,704 INFO L226 Difference]: Without dead ends: 961 [2023-12-25 07:38:47,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 07:38:47,705 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 495 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:47,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 437 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:38:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2023-12-25 07:38:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 937. [2023-12-25 07:38:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 1.2371794871794872) internal successors, (1158), 936 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1158 transitions. [2023-12-25 07:38:47,750 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1158 transitions. Word has length 90 [2023-12-25 07:38:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:47,750 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1158 transitions. [2023-12-25 07:38:47,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1158 transitions. [2023-12-25 07:38:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 07:38:47,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:47,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:47,761 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-25 07:38:47,954 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-25 07:38:47,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:47,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1686625031, now seen corresponding path program 1 times [2023-12-25 07:38:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177110107] [2023-12-25 07:38:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:47,956 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-25 07:38:47,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:47,957 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-25 07:38:47,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 07:38:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:48,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:38:48,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:48,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:49,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:49,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177110107] [2023-12-25 07:38:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177110107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:49,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:38:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156529916] [2023-12-25 07:38:49,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:49,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:38:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:38:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:38:49,363 INFO L87 Difference]: Start difference. First operand 937 states and 1158 transitions. Second operand has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:54,000 INFO L93 Difference]: Finished difference Result 1773 states and 2182 transitions. [2023-12-25 07:38:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 07:38:54,001 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-25 07:38:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:54,006 INFO L225 Difference]: With dead ends: 1773 [2023-12-25 07:38:54,006 INFO L226 Difference]: Without dead ends: 1603 [2023-12-25 07:38:54,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-25 07:38:54,009 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 622 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:54,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1713 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:38:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2023-12-25 07:38:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 677. [2023-12-25 07:38:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.2396449704142012) internal successors, (838), 676 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 838 transitions. [2023-12-25 07:38:54,073 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 838 transitions. Word has length 91 [2023-12-25 07:38:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:54,073 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 838 transitions. [2023-12-25 07:38:54,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 838 transitions. [2023-12-25 07:38:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 07:38:54,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:54,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:54,077 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-25 07:38:54,274 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-25 07:38:54,275 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:54,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 362660805, now seen corresponding path program 1 times [2023-12-25 07:38:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475478025] [2023-12-25 07:38:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:54,275 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-25 07:38:54,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:54,276 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-25 07:38:54,278 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-25 07:38:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:54,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:38:54,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:55,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:55,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475478025] [2023-12-25 07:38:55,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475478025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:55,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:55,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:38:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957478764] [2023-12-25 07:38:55,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:55,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:38:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:38:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:38:55,473 INFO L87 Difference]: Start difference. First operand 677 states and 838 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:56,533 INFO L93 Difference]: Finished difference Result 1201 states and 1503 transitions. [2023-12-25 07:38:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 07:38:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-25 07:38:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:56,535 INFO L225 Difference]: With dead ends: 1201 [2023-12-25 07:38:56,535 INFO L226 Difference]: Without dead ends: 679 [2023-12-25 07:38:56,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=1428, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:38:56,537 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 363 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:56,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 431 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:38:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2023-12-25 07:38:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2023-12-25 07:38:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.2248520710059172) internal successors, (828), 676 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 828 transitions. [2023-12-25 07:38:56,564 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 828 transitions. Word has length 91 [2023-12-25 07:38:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 828 transitions. [2023-12-25 07:38:56,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 828 transitions. [2023-12-25 07:38:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 07:38:56,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:56,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:56,567 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-25 07:38:56,767 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-25 07:38:56,768 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:56,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1672655722, now seen corresponding path program 1 times [2023-12-25 07:38:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85082844] [2023-12-25 07:38:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:56,769 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-25 07:38:56,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:56,770 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-25 07:38:56,770 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-25 07:38:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:56,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:38:56,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:38:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:57,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:38:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:38:58,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:38:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85082844] [2023-12-25 07:38:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85082844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:38:58,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:38:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:38:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132035813] [2023-12-25 07:38:58,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:38:58,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:38:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:38:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:38:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:38:58,138 INFO L87 Difference]: Start difference. First operand 677 states and 828 transitions. Second operand has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:38:59,555 INFO L93 Difference]: Finished difference Result 1405 states and 1736 transitions. [2023-12-25 07:38:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 07:38:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-25 07:38:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:38:59,559 INFO L225 Difference]: With dead ends: 1405 [2023-12-25 07:38:59,559 INFO L226 Difference]: Without dead ends: 1035 [2023-12-25 07:38:59,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 07:38:59,561 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 376 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:38:59,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 810 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:38:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-12-25 07:38:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 948. [2023-12-25 07:38:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 1.2238648363252376) internal successors, (1159), 947 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1159 transitions. [2023-12-25 07:38:59,626 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1159 transitions. Word has length 92 [2023-12-25 07:38:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:38:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1159 transitions. [2023-12-25 07:38:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:38:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1159 transitions. [2023-12-25 07:38:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 07:38:59,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:38:59,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:38:59,633 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-25 07:38:59,828 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 [2023-12-25 07:38:59,829 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:38:59,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:38:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1317950150, now seen corresponding path program 1 times [2023-12-25 07:38:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:38:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453543273] [2023-12-25 07:38:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:38:59,829 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-25 07:38:59,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:38:59,831 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:38:59,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 07:38:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:38:59,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:38:59,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:00,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:01,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:01,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453543273] [2023-12-25 07:39:01,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453543273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:01,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819600498] [2023-12-25 07:39:01,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:01,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:01,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:01,088 INFO L87 Difference]: Start difference. First operand 948 states and 1159 transitions. Second operand has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:05,080 INFO L93 Difference]: Finished difference Result 2257 states and 2752 transitions. [2023-12-25 07:39:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-25 07:39:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-25 07:39:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:05,084 INFO L225 Difference]: With dead ends: 2257 [2023-12-25 07:39:05,084 INFO L226 Difference]: Without dead ends: 1904 [2023-12-25 07:39:05,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-25 07:39:05,086 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 567 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:05,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1487 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 07:39:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2023-12-25 07:39:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1692. [2023-12-25 07:39:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 1.20816085156712) internal successors, (2043), 1691 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2043 transitions. [2023-12-25 07:39:05,228 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2043 transitions. Word has length 92 [2023-12-25 07:39:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:05,228 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 2043 transitions. [2023-12-25 07:39:05,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2043 transitions. [2023-12-25 07:39:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:05,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:05,232 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:05,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:05,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:05,433 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:05,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1282993781, now seen corresponding path program 1 times [2023-12-25 07:39:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15081466] [2023-12-25 07:39:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:05,434 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-25 07:39:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:05,435 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-25 07:39:05,436 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-25 07:39:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:05,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:05,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-12-25 07:39:05,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:05,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15081466] [2023-12-25 07:39:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15081466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889725197] [2023-12-25 07:39:05,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:05,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:05,852 INFO L87 Difference]: Start difference. First operand 1692 states and 2043 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:06,014 INFO L93 Difference]: Finished difference Result 2442 states and 2987 transitions. [2023-12-25 07:39:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-12-25 07:39:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:06,020 INFO L225 Difference]: With dead ends: 2442 [2023-12-25 07:39:06,020 INFO L226 Difference]: Without dead ends: 2168 [2023-12-25 07:39:06,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:06,022 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 78 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:06,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 231 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:39:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2023-12-25 07:39:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2100. [2023-12-25 07:39:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.2010481181515007) internal successors, (2521), 2099 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2521 transitions. [2023-12-25 07:39:06,162 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2521 transitions. Word has length 129 [2023-12-25 07:39:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:06,162 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 2521 transitions. [2023-12-25 07:39:06,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2521 transitions. [2023-12-25 07:39:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:06,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:06,164 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:06,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-25 07:39:06,366 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-25 07:39:06,366 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:06,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -857593867, now seen corresponding path program 2 times [2023-12-25 07:39:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:06,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748033301] [2023-12-25 07:39:06,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:06,367 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-25 07:39:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:06,368 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-25 07:39:06,377 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-25 07:39:06,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:06,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:06,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:06,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-25 07:39:06,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:06,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748033301] [2023-12-25 07:39:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748033301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:06,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:06,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:06,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347667309] [2023-12-25 07:39:06,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:06,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:06,751 INFO L87 Difference]: Start difference. First operand 2100 states and 2521 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:06,896 INFO L93 Difference]: Finished difference Result 2656 states and 3242 transitions. [2023-12-25 07:39:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-12-25 07:39:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:06,903 INFO L225 Difference]: With dead ends: 2656 [2023-12-25 07:39:06,903 INFO L226 Difference]: Without dead ends: 2002 [2023-12-25 07:39:06,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:06,905 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 98 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:06,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 216 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2023-12-25 07:39:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1866. [2023-12-25 07:39:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.1865951742627345) internal successors, (2213), 1865 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2213 transitions. [2023-12-25 07:39:07,032 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2213 transitions. Word has length 129 [2023-12-25 07:39:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:07,033 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2213 transitions. [2023-12-25 07:39:07,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2213 transitions. [2023-12-25 07:39:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:07,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:07,034 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:07,048 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-25 07:39:07,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:07,237 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:07,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash -502888295, now seen corresponding path program 2 times [2023-12-25 07:39:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907262403] [2023-12-25 07:39:07,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:07,238 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-25 07:39:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:07,239 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:07,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 07:39:07,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:07,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:07,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:07,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-25 07:39:07,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:07,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907262403] [2023-12-25 07:39:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907262403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508442583] [2023-12-25 07:39:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:07,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:07,614 INFO L87 Difference]: Start difference. First operand 1866 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:07,731 INFO L93 Difference]: Finished difference Result 2435 states and 2949 transitions. [2023-12-25 07:39:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:07,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-12-25 07:39:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:07,736 INFO L225 Difference]: With dead ends: 2435 [2023-12-25 07:39:07,736 INFO L226 Difference]: Without dead ends: 2106 [2023-12-25 07:39:07,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:07,737 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:07,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 251 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2023-12-25 07:39:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2038. [2023-12-25 07:39:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 2037 states have (on average 1.180166912125675) internal successors, (2404), 2037 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2404 transitions. [2023-12-25 07:39:07,842 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2404 transitions. Word has length 129 [2023-12-25 07:39:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:07,842 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 2404 transitions. [2023-12-25 07:39:07,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2404 transitions. [2023-12-25 07:39:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 07:39:07,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:07,844 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:07,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:08,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:08,046 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:08,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1778535200, now seen corresponding path program 1 times [2023-12-25 07:39:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727461220] [2023-12-25 07:39:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:08,047 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-25 07:39:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:08,048 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:08,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 07:39:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:08,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:39:08,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 130 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:39:09,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 61 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:11,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727461220] [2023-12-25 07:39:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727461220] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:11,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:11,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-25 07:39:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55232861] [2023-12-25 07:39:11,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:11,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 07:39:11,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 07:39:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 07:39:11,457 INFO L87 Difference]: Start difference. First operand 2038 states and 2404 transitions. Second operand has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:44,894 INFO L93 Difference]: Finished difference Result 6483 states and 7689 transitions. [2023-12-25 07:39:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2023-12-25 07:39:44,896 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2023-12-25 07:39:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:44,906 INFO L225 Difference]: With dead ends: 6483 [2023-12-25 07:39:44,906 INFO L226 Difference]: Without dead ends: 5519 [2023-12-25 07:39:44,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12394 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=4921, Invalid=29861, Unknown=0, NotChecked=0, Total=34782 [2023-12-25 07:39:44,913 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 2284 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:44,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 1729 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-25 07:39:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2023-12-25 07:39:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 4664. [2023-12-25 07:39:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 1.1840017156337121) internal successors, (5521), 4663 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 5521 transitions. [2023-12-25 07:39:45,150 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 5521 transitions. Word has length 130 [2023-12-25 07:39:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:45,150 INFO L495 AbstractCegarLoop]: Abstraction has 4664 states and 5521 transitions. [2023-12-25 07:39:45,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 5521 transitions. [2023-12-25 07:39:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 07:39:45,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:45,153 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:45,157 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:45,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:45,355 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:45,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1608610891, now seen corresponding path program 1 times [2023-12-25 07:39:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018199846] [2023-12-25 07:39:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:45,356 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-25 07:39:45,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:45,356 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 07:39:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:45,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:39:45,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:39:46,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:39:47,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:47,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018199846] [2023-12-25 07:39:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018199846] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:47,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:39:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685746128] [2023-12-25 07:39:47,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:47,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:39:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:39:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:39:47,899 INFO L87 Difference]: Start difference. First operand 4664 states and 5521 transitions. Second operand has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:40:11,227 INFO L93 Difference]: Finished difference Result 9088 states and 10773 transitions. [2023-12-25 07:40:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-12-25 07:40:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-25 07:40:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:40:11,241 INFO L225 Difference]: With dead ends: 9088 [2023-12-25 07:40:11,241 INFO L226 Difference]: Without dead ends: 6825 [2023-12-25 07:40:11,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7084 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=3143, Invalid=17163, Unknown=0, NotChecked=0, Total=20306 [2023-12-25 07:40:11,246 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1260 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:40:11,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1862 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 07:40:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6825 states. [2023-12-25 07:40:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6825 to 6587. [2023-12-25 07:40:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 1.1774977224415426) internal successors, (7755), 6586 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 7755 transitions. [2023-12-25 07:40:11,725 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 7755 transitions. Word has length 131 [2023-12-25 07:40:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:40:11,725 INFO L495 AbstractCegarLoop]: Abstraction has 6587 states and 7755 transitions. [2023-12-25 07:40:11,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 7755 transitions. [2023-12-25 07:40:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 07:40:11,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:40:11,729 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:40:11,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-25 07:40:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:40:11,931 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:40:11,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:40:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -261386733, now seen corresponding path program 1 times [2023-12-25 07:40:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:40:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658996296] [2023-12-25 07:40:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:40:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:40:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:40:11,933 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:40:11,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 07:40:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:40:12,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:40:12,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:40:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:40:13,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:40:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:40:14,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:40:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658996296] [2023-12-25 07:40:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658996296] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:40:14,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:40:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:40:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547653894] [2023-12-25 07:40:14,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:40:14,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:40:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:40:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:40:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:40:14,472 INFO L87 Difference]: Start difference. First operand 6587 states and 7755 transitions. Second operand has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:40:38,703 INFO L93 Difference]: Finished difference Result 11604 states and 13740 transitions. [2023-12-25 07:40:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-12-25 07:40:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-25 07:40:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:40:38,716 INFO L225 Difference]: With dead ends: 11604 [2023-12-25 07:40:38,717 INFO L226 Difference]: Without dead ends: 9342 [2023-12-25 07:40:38,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10598 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=4472, Invalid=24598, Unknown=0, NotChecked=0, Total=29070 [2023-12-25 07:40:38,721 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 2025 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:40:38,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 2092 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 07:40:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9342 states. [2023-12-25 07:40:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9342 to 7222. [2023-12-25 07:40:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7222 states, 7221 states have (on average 1.1797534967456031) internal successors, (8519), 7221 states have internal predecessors, (8519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 8519 transitions. [2023-12-25 07:40:39,138 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 8519 transitions. Word has length 131 [2023-12-25 07:40:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:40:39,139 INFO L495 AbstractCegarLoop]: Abstraction has 7222 states and 8519 transitions. [2023-12-25 07:40:39,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:40:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 8519 transitions. [2023-12-25 07:40:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-25 07:40:39,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:40:39,141 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:40:39,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-25 07:40:39,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:40:39,344 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:40:39,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:40:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1795397696, now seen corresponding path program 1 times [2023-12-25 07:40:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:40:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664816950] [2023-12-25 07:40:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:40:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:40:39,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:40:39,346 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:40:39,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 07:40:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:40:39,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 07:40:39,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:40:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 132 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:40:40,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:40:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:40:42,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:40:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664816950] [2023-12-25 07:40:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664816950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:40:42,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:40:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-25 07:40:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054376296] [2023-12-25 07:40:42,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:40:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 07:40:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:40:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 07:40:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 07:40:42,487 INFO L87 Difference]: Start difference. First operand 7222 states and 8519 transitions. Second operand has 36 states, 36 states have (on average 5.444444444444445) internal successors, (196), 36 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:01,195 INFO L93 Difference]: Finished difference Result 15030 states and 17859 transitions. [2023-12-25 07:41:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-12-25 07:41:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.444444444444445) internal successors, (196), 36 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2023-12-25 07:41:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:01,208 INFO L225 Difference]: With dead ends: 15030 [2023-12-25 07:41:01,208 INFO L226 Difference]: Without dead ends: 9671 [2023-12-25 07:41:01,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7024 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=3914, Invalid=16678, Unknown=0, NotChecked=0, Total=20592 [2023-12-25 07:41:01,214 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 928 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:01,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1923 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 07:41:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2023-12-25 07:41:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9000. [2023-12-25 07:41:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9000 states, 8999 states have (on average 1.1840204467163018) internal successors, (10655), 8999 states have internal predecessors, (10655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 10655 transitions. [2023-12-25 07:41:01,711 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 10655 transitions. Word has length 132 [2023-12-25 07:41:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:01,711 INFO L495 AbstractCegarLoop]: Abstraction has 9000 states and 10655 transitions. [2023-12-25 07:41:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.444444444444445) internal successors, (196), 36 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 10655 transitions. [2023-12-25 07:41:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:41:01,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:01,714 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:01,719 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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:01,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:01,917 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:01,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 564215227, now seen corresponding path program 1 times [2023-12-25 07:41:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860408232] [2023-12-25 07:41:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:01,918 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-25 07:41:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:01,919 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:41:01,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 07:41:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:41:01,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:41:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:41:02,117 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:41:02,117 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:41:02,118 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:41:02,132 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 (29)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:02,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:02,325 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:02,328 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:41:02,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:41:02 BoogieIcfgContainer [2023-12-25 07:41:02,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:41:02,432 INFO L158 Benchmark]: Toolchain (without parser) took 146734.67ms. Allocated memory was 319.8MB in the beginning and 675.3MB in the end (delta: 355.5MB). Free memory was 282.2MB in the beginning and 304.6MB in the end (delta: -22.3MB). Peak memory consumption was 334.7MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,432 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 234.9MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:41:02,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.12ms. Allocated memory is still 319.8MB. Free memory was 281.7MB in the beginning and 267.6MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.85ms. Allocated memory is still 319.8MB. Free memory was 267.6MB in the beginning and 265.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,433 INFO L158 Benchmark]: Boogie Preprocessor took 32.44ms. Allocated memory is still 319.8MB. Free memory was 265.5MB in the beginning and 262.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,433 INFO L158 Benchmark]: RCFGBuilder took 365.35ms. Allocated memory is still 319.8MB. Free memory was 262.8MB in the beginning and 241.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,433 INFO L158 Benchmark]: TraceAbstraction took 146055.73ms. Allocated memory was 319.8MB in the beginning and 675.3MB in the end (delta: 355.5MB). Free memory was 240.8MB in the beginning and 304.6MB in the end (delta: -63.7MB). Peak memory consumption was 292.8MB. Max. memory is 8.0GB. [2023-12-25 07:41:02,434 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.18ms. Allocated memory is still 234.9MB. Free memory is still 182.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.12ms. Allocated memory is still 319.8MB. Free memory was 281.7MB in the beginning and 267.6MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.85ms. Allocated memory is still 319.8MB. Free memory was 267.6MB in the beginning and 265.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.44ms. Allocated memory is still 319.8MB. Free memory was 265.5MB in the beginning and 262.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 365.35ms. Allocated memory is still 319.8MB. Free memory was 262.8MB in the beginning and 241.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 146055.73ms. Allocated memory was 319.8MB in the beginning and 675.3MB in the end (delta: 355.5MB). Free memory was 240.8MB in the beginning and 304.6MB in the end (delta: -63.7MB). Peak memory consumption was 292.8MB. 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 - CounterExampleResult [Line: 282]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] port_t p2 ; [L35] char p2_old ; [L36] char p2_new ; [L37] char id2 ; [L38] char st2 ; [L39] msg_t send2 ; [L40] _Bool mode2 ; [L41] port_t p3 ; [L42] char p3_old ; [L43] char p3_new ; [L44] char id3 ; [L45] char st3 ; [L46] msg_t send3 ; [L47] _Bool mode3 ; [L229] int c1 ; [L230] int i2 ; [L233] c1 = 0 [L234] r1 = __VERIFIER_nondet_char() [L235] id1 = __VERIFIER_nondet_char() [L236] st1 = __VERIFIER_nondet_char() [L237] send1 = __VERIFIER_nondet_char() [L238] mode1 = __VERIFIER_nondet_bool() [L239] id2 = __VERIFIER_nondet_char() [L240] st2 = __VERIFIER_nondet_char() [L241] send2 = __VERIFIER_nondet_char() [L242] mode2 = __VERIFIER_nondet_bool() [L243] id3 = __VERIFIER_nondet_char() [L244] st3 = __VERIFIER_nondet_char() [L245] send3 = __VERIFIER_nondet_char() [L246] mode3 = __VERIFIER_nondet_bool() [L247] CALL, EXPR init() [L128] int tmp ; VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L131] COND TRUE (int )r1 == 0 VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L132] COND TRUE (int )id1 >= 0 VAL [id1=64, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L133] COND TRUE (int )st1 == 0 VAL [id1=64, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L134] COND TRUE (int )send1 == (int )id1 VAL [id1=64, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L135] COND TRUE (int )mode1 == 0 VAL [id1=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L136] COND TRUE (int )id2 >= 0 VAL [id1=64, id2=32, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L137] COND TRUE (int )st2 == 0 VAL [id1=64, id2=32, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0, st2=0] [L138] COND TRUE (int )send2 == (int )id2 VAL [id1=64, id2=32, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L139] COND TRUE (int )mode2 == 0 VAL [id1=64, id2=32, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L140] COND TRUE (int )id3 >= 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L141] COND TRUE (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0, st3=0] [L142] COND TRUE (int )send3 == (int )id3 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L143] COND TRUE (int )mode3 == 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L144] COND TRUE (int )id1 != (int )id2 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L145] COND TRUE (int )id1 != (int )id3 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE (int )id2 != (int )id3 [L147] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L196] return (tmp); [L247] RET, EXPR init() [L247] i2 = init() [L248] COND FALSE !(!(i2)) VAL [c1=0, i2=1, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L249] p1_old = nomsg [L250] p1_new = nomsg [L251] p2_old = nomsg [L252] p2_new = nomsg [L253] p3_old = nomsg [L254] p3_new = nomsg [L255] i2 = 0 VAL [c1=0, i2=0, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=1, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=64, id2=32, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=64, id2=32, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=64, id2=32, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 VAL [id1=64, id2=32, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m1=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=64, id2=32, id3=0, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=64, id2=32, id3=0, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 VAL [id1=64, id2=32, id3=0, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=64, id2=32, id3=0, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=64, id2=32, id3=0, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=64, id2=32, id3=0, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m3=32, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=2, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=3, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=64, id2=32, id3=0, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=64, id2=32, id3=0, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=64, id2=32, id3=0, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 VAL [id1=64, id2=32, id3=0, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m1=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=64, id2=32, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=64, id2=32, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L86] COND FALSE !((int )m2 > (int )id2) VAL [id1=64, id2=32, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L89] COND FALSE !((int )m2 == (int )id2) VAL [id1=64, id2=32, id3=0, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m2=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=4, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=64, id2=32, id3=0, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [c1=1, i2=5, id1=64, id2=32, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=64, id2=32, id3=0, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=64, id2=32, id3=0, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=64, id2=32, id3=0, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=64, id2=32, id3=0, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L62] COND TRUE (int )m1 == (int )id1 [L63] st1 = (char)1 VAL [id1=64, id2=32, id3=0, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m1=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=64, id2=32, id3=0, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=64, id2=32, id3=0, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=64, id2=32, id3=0, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L86] COND FALSE !((int )m2 > (int )id2) VAL [id1=64, id2=32, id3=0, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L89] COND TRUE (int )m2 == (int )id2 [L90] st2 = (char)1 VAL [id1=64, id2=32, id3=0, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m2=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=64, id2=32, id3=0, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=64, id2=32, id3=0, m3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L204] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L222] tmp = 0 VAL [id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0, tmp=0] [L224] return (tmp); [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND TRUE ! arg VAL [\old(arg)=0, arg=0, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L282] reach_error() VAL [\old(arg)=0, arg=0, id1=64, id2=32, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 145.9s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 114.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10795 SdHoareTripleChecker+Valid, 20.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10795 mSDsluCounter, 16321 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14049 mSDsCounter, 526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14980 IncrementalHoareTripleChecker+Invalid, 15506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 526 mSolverCounterUnsat, 2272 mSDtfsCounter, 14980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3809 GetRequests, 2797 SyntacticMatches, 1 SemanticMatches, 1011 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 98.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9000occurred in iteration=27, InterpolantAutomatonStates: 807, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 6030 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 2102 NumberOfCodeBlocks, 1926 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3122 ConstructedInterpolants, 715 QuantifiedInterpolants, 40469 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3912 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 40 InterpolantComputations, 14 PerfectInterpolantSequences, 2131/3315 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 proved your program to be incorrect! [2023-12-25 07:41:02,556 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 Received shutdown request...