/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/loop-zilu/benchmark19_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:01:18,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:01:18,059 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 00:01:18,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:01:18,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:01:18,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:01:18,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:01:18,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:01:18,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:01:18,080 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:01:18,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:01:18,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:01:18,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:01:18,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:01:18,082 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:01:18,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:01:18,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:01:18,083 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:01:18,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:01:18,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:01:18,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:01:18,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:01:18,085 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:01:18,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:01:18,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:01:18,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:01:18,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:01:18,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:01:18,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:01:18,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:01:18,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:01:18,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:01:18,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:01:18,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:01:18,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:01:18,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:01:18,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:01:18,088 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:01:18,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:01:18,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:01:18,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:01:18,089 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 00:01:18,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:01:18,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:01:18,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:01:18,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:01:18,340 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:01:18,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i [2023-12-25 00:01:19,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:01:19,565 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:01:19,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i [2023-12-25 00:01:19,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9965dcbb0/74f7f254cf534a6c9715c9714643f43f/FLAGfcf8c1b77 [2023-12-25 00:01:19,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9965dcbb0/74f7f254cf534a6c9715c9714643f43f [2023-12-25 00:01:19,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:01:19,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:01:19,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:01:19,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:01:19,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:01:19,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a12e3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19, skipping insertion in model container [2023-12-25 00:01:19,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,621 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:01:19,749 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i[873,886] [2023-12-25 00:01:19,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:01:19,777 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:01:19,789 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark19_conjunctive.i[873,886] [2023-12-25 00:01:19,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:01:19,806 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:01:19,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19 WrapperNode [2023-12-25 00:01:19,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:01:19,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:01:19,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:01:19,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:01:19,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,838 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2023-12-25 00:01:19,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:01:19,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:01:19,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:01:19,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:01:19,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,858 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 00:01:19,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:01:19,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:01:19,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:01:19,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:01:19,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (1/1) ... [2023-12-25 00:01:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:01:19,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:01:19,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 00:01:19,916 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 00:01:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:01:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:01:19,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:01:19,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:01:19,986 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:01:19,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:01:20,073 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:01:20,091 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:01:20,091 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:01:20,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:01:20 BoogieIcfgContainer [2023-12-25 00:01:20,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:01:20,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:01:20,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:01:20,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:01:20,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:01:19" (1/3) ... [2023-12-25 00:01:20,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3d4cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:01:20, skipping insertion in model container [2023-12-25 00:01:20,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:01:19" (2/3) ... [2023-12-25 00:01:20,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3d4cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:01:20, skipping insertion in model container [2023-12-25 00:01:20,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:01:20" (3/3) ... [2023-12-25 00:01:20,098 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark19_conjunctive.i [2023-12-25 00:01:20,111 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:01:20,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:01:20,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:01:20,149 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;@17b2fd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:01:20,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:01:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 00:01:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:01:20,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:20,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:01:20,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:20,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1839286506, now seen corresponding path program 1 times [2023-12-25 00:01:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378670205] [2023-12-25 00:01:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:20,175 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 00:01:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:20,187 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 00:01:20,198 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 00:01:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:20,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:01:20,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:20,247 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 00:01:20,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:01:20,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378670205] [2023-12-25 00:01:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378670205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:01:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:01:20,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:01:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93016513] [2023-12-25 00:01:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:01:20,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:01:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:01:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:01:20,279 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 00:01:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:20,300 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2023-12-25 00:01:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:01:20,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-25 00:01:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:20,309 INFO L225 Difference]: With dead ends: 17 [2023-12-25 00:01:20,310 INFO L226 Difference]: Without dead ends: 7 [2023-12-25 00:01:20,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 00:01:20,317 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:20,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-25 00:01:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-25 00:01:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 00:01:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-25 00:01:20,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2023-12-25 00:01:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:20,339 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-25 00:01:20,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 00:01:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-25 00:01:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 00:01:20,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:20,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 00:01:20,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 00:01:20,543 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 00:01:20,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:20,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1839167342, now seen corresponding path program 1 times [2023-12-25 00:01:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571170699] [2023-12-25 00:01:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:20,545 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 00:01:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:20,546 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 00:01:20,548 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 00:01:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:20,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 00:01:20,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:20,664 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 00:01:20,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:01:20,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571170699] [2023-12-25 00:01:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571170699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:01:20,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:01:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 00:01:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18590395] [2023-12-25 00:01:20,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:01:20,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 00:01:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 00:01:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 00:01:20,688 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:01:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:20,706 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-12-25 00:01:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 00:01:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-12-25 00:01:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:20,713 INFO L225 Difference]: With dead ends: 12 [2023-12-25 00:01:20,713 INFO L226 Difference]: Without dead ends: 8 [2023-12-25 00:01:20,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 00:01:20,714 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:20,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:01:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-25 00:01:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-25 00:01:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 00:01:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-25 00:01:20,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-12-25 00:01:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:20,718 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-25 00:01:20,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:01:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-25 00:01:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:01:20,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:20,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:20,738 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 00:01:20,941 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 00:01:20,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:20,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1181278160, now seen corresponding path program 1 times [2023-12-25 00:01:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396199748] [2023-12-25 00:01:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:20,943 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 00:01:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:20,947 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 00:01:20,987 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 00:01:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:21,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 00:01:21,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:21,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:21,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396199748] [2023-12-25 00:01:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396199748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:21,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-25 00:01:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694013166] [2023-12-25 00:01:21,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:21,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 00:01:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:21,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 00:01:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:01:21,400 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:21,663 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-12-25 00:01:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 00:01:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 00:01:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:21,664 INFO L225 Difference]: With dead ends: 19 [2023-12-25 00:01:21,664 INFO L226 Difference]: Without dead ends: 11 [2023-12-25 00:01:21,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-12-25 00:01:21,665 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:21,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 00:01:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-25 00:01:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-25 00:01:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 00:01:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-25 00:01:21,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-25 00:01:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:21,670 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-25 00:01:21,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-25 00:01:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 00:01:21,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:21,672 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:21,686 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 00:01:21,887 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 00:01:21,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:21,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 149389294, now seen corresponding path program 2 times [2023-12-25 00:01:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427403431] [2023-12-25 00:01:21,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:01:21,889 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 00:01:21,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:21,894 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 00:01:21,900 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 00:01:21,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:01:21,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:21,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 00:01:21,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:22,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:22,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427403431] [2023-12-25 00:01:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427403431] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:22,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:22,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-12-25 00:01:22,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953738318] [2023-12-25 00:01:22,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:22,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 00:01:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 00:01:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-25 00:01:22,672 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 00:01:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:24,445 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2023-12-25 00:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 00:01:24,446 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 10 [2023-12-25 00:01:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:24,446 INFO L225 Difference]: With dead ends: 29 [2023-12-25 00:01:24,446 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 00:01:24,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2023-12-25 00:01:24,448 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:24,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 13 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 00:01:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 00:01:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 00:01:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 00:01:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-25 00:01:24,452 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-12-25 00:01:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:24,452 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-25 00:01:24,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 00:01:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-25 00:01:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 00:01:24,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:24,453 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:24,460 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 00:01:24,660 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 00:01:24,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:24,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 443815086, now seen corresponding path program 3 times [2023-12-25 00:01:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965223850] [2023-12-25 00:01:24,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 00:01:24,664 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 00:01:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:24,665 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 00:01:24,667 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 00:01:24,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-25 00:01:24,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:24,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 00:01:24,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:25,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:26,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965223850] [2023-12-25 00:01:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965223850] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:26,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-12-25 00:01:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971637031] [2023-12-25 00:01:26,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:26,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 00:01:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 00:01:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2023-12-25 00:01:26,600 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:37,258 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-12-25 00:01:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-25 00:01:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-25 00:01:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:37,259 INFO L225 Difference]: With dead ends: 55 [2023-12-25 00:01:37,259 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:01:37,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1083, Invalid=3473, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 00:01:37,261 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 140 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:37,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 34 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 00:01:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:01:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:01:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 00:01:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-12-25 00:01:37,271 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2023-12-25 00:01:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:37,274 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-12-25 00:01:37,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:01:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-12-25 00:01:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:01:37,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:37,274 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:37,282 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 00:01:37,480 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 00:01:37,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:37,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1535217198, now seen corresponding path program 4 times [2023-12-25 00:01:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:37,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854465855] [2023-12-25 00:01:37,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 00:01:37,482 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 00:01:37,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:37,484 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 00:01:37,489 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 00:01:37,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 00:01:37,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:37,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-25 00:01:37,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:38,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:43,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854465855] [2023-12-25 00:01:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854465855] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:43,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-12-25 00:01:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494708788] [2023-12-25 00:01:43,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-25 00:01:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-25 00:01:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1981, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 00:01:43,639 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 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 00:02:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:02:39,761 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2023-12-25 00:02:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 00:02:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 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 28 [2023-12-25 00:02:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:02:39,767 INFO L225 Difference]: With dead ends: 63 [2023-12-25 00:02:39,767 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 00:02:39,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 59.5s TimeCoverageRelationStatistics Valid=2597, Invalid=8115, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 00:02:39,769 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 398 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:02:39,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 54 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 00:02:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 00:02:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 00:02:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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 00:02:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2023-12-25 00:02:39,805 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2023-12-25 00:02:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:02:39,805 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2023-12-25 00:02:39,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 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 00:02:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2023-12-25 00:02:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 00:02:39,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:02:39,807 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2023-12-25 00:02:39,811 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 00:02:40,011 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 00:02:40,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:02:40,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:02:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1220689618, now seen corresponding path program 5 times [2023-12-25 00:02:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:02:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166396467] [2023-12-25 00:02:40,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 00:02:40,013 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 00:02:40,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:02:40,014 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 00:02:40,038 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 00:02:40,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-25 00:02:40,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:02:40,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2023-12-25 00:02:40,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:02:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:02:44,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:03:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:03:03,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:03:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166396467] [2023-12-25 00:03:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166396467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:03:03,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:03:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2023-12-25 00:03:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968885429] [2023-12-25 00:03:03,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:03:03,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2023-12-25 00:03:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:03:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2023-12-25 00:03:03,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2001, Invalid=7701, Unknown=0, NotChecked=0, Total=9702 [2023-12-25 00:03:03,047 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 99 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 99 states have internal predecessors, (102), 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 00:03:52,547 WARN L293 SmtUtils]: Spent 16.22s on a formula simplification. DAG size of input: 466 DAG size of output: 430 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:04:15,733 WARN L293 SmtUtils]: Spent 15.23s on a formula simplification. DAG size of input: 457 DAG size of output: 421 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:04:26,323 WARN L293 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 463 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:04:49,345 WARN L293 SmtUtils]: Spent 14.84s on a formula simplification. DAG size of input: 448 DAG size of output: 412 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:05:00,398 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 465 DAG size of output: 245 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:05:21,273 WARN L293 SmtUtils]: Spent 13.50s on a formula simplification. DAG size of input: 439 DAG size of output: 403 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:05:42,421 WARN L293 SmtUtils]: Spent 13.14s on a formula simplification. DAG size of input: 430 DAG size of output: 394 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:06:02,575 WARN L293 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 421 DAG size of output: 385 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:06:23,171 WARN L293 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 412 DAG size of output: 376 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:06:43,328 WARN L293 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 403 DAG size of output: 367 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:00,735 WARN L293 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 394 DAG size of output: 358 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:17,456 WARN L293 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 385 DAG size of output: 349 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:33,727 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification. DAG size of input: 375 DAG size of output: 340 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:07:49,854 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 365 DAG size of output: 331 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:04,526 WARN L293 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 355 DAG size of output: 322 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:14,513 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 458 DAG size of output: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:27,458 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 345 DAG size of output: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:36,365 WARN L293 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 448 DAG size of output: 236 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:45,068 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 460 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:08:56,114 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 335 DAG size of output: 304 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:12,383 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 450 DAG size of output: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:23,761 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 325 DAG size of output: 295 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:09:41,082 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 440 DAG size of output: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:11:47,258 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 390 DAG size of output: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:11:59,016 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 265 DAG size of output: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 00:16:04,076 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:16:04,089 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:16:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-12-25 00:16:04,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8012 ImplicationChecksByTransitivity, 792.9s TimeCoverageRelationStatistics Valid=10388, Invalid=37354, Unknown=0, NotChecked=0, Total=47742 [2023-12-25 00:16:04,111 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1823 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:16:04,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 2 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-25 00:16:04,113 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:16:04,119 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 00:16:04,318 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 00:16:04,319 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (53states) and FLOYD_HOARE automaton (currently 123 states, 99 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. [2023-12-25 00:16:04,326 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2023-12-25 00:16:04,329 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:16:04,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:16:04 BoogieIcfgContainer [2023-12-25 00:16:04,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:16:04,333 INFO L158 Benchmark]: Toolchain (without parser) took 884747.82ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 157.0MB in the beginning and 109.5MB in the end (delta: 47.6MB). Peak memory consumption was 89.7MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,345 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 167.8MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:16:04,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.50ms. Allocated memory is still 202.4MB. Free memory was 156.7MB in the beginning and 145.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.39ms. Allocated memory is still 202.4MB. Free memory was 145.8MB in the beginning and 144.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,346 INFO L158 Benchmark]: Boogie Preprocessor took 28.97ms. Allocated memory is still 202.4MB. Free memory was 144.1MB in the beginning and 142.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,347 INFO L158 Benchmark]: RCFGBuilder took 222.70ms. Allocated memory is still 202.4MB. Free memory was 142.4MB in the beginning and 131.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,347 INFO L158 Benchmark]: TraceAbstraction took 884239.26ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 131.2MB in the beginning and 109.5MB in the end (delta: 21.7MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2023-12-25 00:16:04,348 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.53ms. Allocated memory is still 167.8MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.50ms. Allocated memory is still 202.4MB. Free memory was 156.7MB in the beginning and 145.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.39ms. Allocated memory is still 202.4MB. Free memory was 145.8MB in the beginning and 144.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.97ms. Allocated memory is still 202.4MB. Free memory was 144.1MB in the beginning and 142.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.70ms. Allocated memory is still 202.4MB. Free memory was 142.4MB in the beginning and 131.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 884239.26ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 131.2MB in the beginning and 109.5MB in the end (delta: 21.7MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was constructing difference of abstraction (53states) and FLOYD_HOARE automaton (currently 123 states, 99 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.2s, OverallIterations: 7, TraceHistogramMax: 46, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 850.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2408 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2408 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3665 IncrementalHoareTripleChecker+Invalid, 4241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 27 mSDtfsCounter, 3665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10629 ImplicationChecksByTransitivity, 866.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3706 SizeOfPredicates, 37 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown