/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/nla-digbench-scaling/hard2_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:34:40,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:34:40,353 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 03:34:40,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:34:40,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:34:40,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:34:40,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:34:40,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:34:40,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:34:40,376 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:34:40,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:34:40,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:34:40,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:34:40,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:34:40,377 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:34:40,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:34:40,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:34:40,378 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:34:40,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:34:40,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:34:40,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:34:40,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:34:40,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:34:40,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:34:40,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:34:40,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:34:40,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:34:40,381 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:34:40,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:34:40,381 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:34:40,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:34:40,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:34:40,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:34:40,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:34:40,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:34:40,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:34:40,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:34:40,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:34:40,383 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:34:40,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:34:40,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:34:40,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:34:40,384 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:34:40,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:34:40,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:34:40,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:34:40,384 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 03:34:40,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:34:40,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:34:40,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:34:40,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:34:40,588 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:34:40,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2023-12-25 03:34:41,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:34:41,721 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:34:41,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2023-12-25 03:34:41,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee6dcb92/6259a577df1c4e449818df0935a58f94/FLAGc1ca25fe4 [2023-12-25 03:34:41,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee6dcb92/6259a577df1c4e449818df0935a58f94 [2023-12-25 03:34:41,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:34:41,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:34:41,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:34:41,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:34:41,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:34:41,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7449794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41, skipping insertion in model container [2023-12-25 03:34:41,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:34:41,865 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2023-12-25 03:34:41,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:34:41,891 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:34:41,900 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2023-12-25 03:34:41,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:34:41,913 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:34:41,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41 WrapperNode [2023-12-25 03:34:41,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:34:41,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:34:41,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:34:41,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:34:41,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,937 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2023-12-25 03:34:41,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:34:41,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:34:41,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:34:41,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:34:41,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,955 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 03:34:41,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:34:41,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:34:41,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:34:41,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:34:41,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (1/1) ... [2023-12-25 03:34:41,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:34:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:34:41,993 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 03:34:41,996 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 03:34:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:34:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:34:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:34:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:34:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:34:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:34:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:34:42,056 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:34:42,058 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:34:42,222 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:34:42,245 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:34:42,245 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:34:42,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:34:42 BoogieIcfgContainer [2023-12-25 03:34:42,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:34:42,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:34:42,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:34:42,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:34:42,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:34:41" (1/3) ... [2023-12-25 03:34:42,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4576cad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:34:42, skipping insertion in model container [2023-12-25 03:34:42,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:34:41" (2/3) ... [2023-12-25 03:34:42,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4576cad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:34:42, skipping insertion in model container [2023-12-25 03:34:42,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:34:42" (3/3) ... [2023-12-25 03:34:42,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound100.c [2023-12-25 03:34:42,262 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:34:42,262 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:34:42,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:34:42,295 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;@1f38a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:34:42,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:34:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 03:34:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 03:34:42,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:42,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:42,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:42,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1291730102, now seen corresponding path program 1 times [2023-12-25 03:34:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111566362] [2023-12-25 03:34:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:42,315 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 03:34:42,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:42,317 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 03:34:42,340 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 03:34:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:42,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:34:42,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:42,420 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 03:34:42,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:42,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111566362] [2023-12-25 03:34:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111566362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:34:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842604461] [2023-12-25 03:34:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:42,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:34:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:34:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:34:42,454 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:42,488 INFO L93 Difference]: Finished difference Result 45 states and 78 transitions. [2023-12-25 03:34:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:34:42,490 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:34:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:42,495 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:34:42,495 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 03:34:42,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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 03:34:42,503 INFO L413 NwaCegarLoop]: 31 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, 31 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 03:34:42,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:34:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 03:34:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 03:34:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:34:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2023-12-25 03:34:42,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2023-12-25 03:34:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:42,547 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2023-12-25 03:34:42,547 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2023-12-25 03:34:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 03:34:42,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:42,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:42,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 03:34:42,751 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 03:34:42,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:42,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 829671692, now seen corresponding path program 1 times [2023-12-25 03:34:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:42,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4043430] [2023-12-25 03:34:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:42,754 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 03:34:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:42,755 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 03:34:42,758 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 03:34:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:42,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:34:42,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:42,843 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 03:34:42,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:42,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4043430] [2023-12-25 03:34:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4043430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 03:34:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626041178] [2023-12-25 03:34:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:34:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:34:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:34:42,846 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:42,939 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2023-12-25 03:34:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:34:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 03:34:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:42,941 INFO L225 Difference]: With dead ends: 35 [2023-12-25 03:34:42,941 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 03:34:42,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:34:42,942 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:42,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 90 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:34:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 03:34:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-25 03:34:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:34:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-25 03:34:42,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2023-12-25 03:34:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:42,949 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-25 03:34:42,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-25 03:34:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 03:34:42,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:42,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:42,956 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 03:34:43,157 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 03:34:43,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:43,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -166824855, now seen corresponding path program 1 times [2023-12-25 03:34:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757704063] [2023-12-25 03:34:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:43,158 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 03:34:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:43,159 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 03:34:43,163 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 03:34:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:43,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 03:34:43,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:34:43,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:43,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757704063] [2023-12-25 03:34:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757704063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:43,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:43,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:34:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062179988] [2023-12-25 03:34:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:43,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 03:34:43,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:43,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 03:34:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 03:34:43,208 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:43,232 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-12-25 03:34:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 03:34:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 03:34:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:43,234 INFO L225 Difference]: With dead ends: 41 [2023-12-25 03:34:43,234 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 03:34:43,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 03:34:43,236 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:43,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:34:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 03:34:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 03:34:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:34:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-25 03:34:43,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-12-25 03:34:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:43,245 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-25 03:34:43,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:34:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-25 03:34:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 03:34:43,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:43,246 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:43,254 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 03:34:43,451 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 03:34:43,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:43,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash -439138420, now seen corresponding path program 1 times [2023-12-25 03:34:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51086601] [2023-12-25 03:34:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:43,452 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 03:34:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:43,453 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 03:34:43,458 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 03:34:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:43,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:34:43,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:34:43,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:43,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51086601] [2023-12-25 03:34:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51086601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:34:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124001592] [2023-12-25 03:34:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:43,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:34:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:34:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:34:43,513 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:34:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:43,650 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-25 03:34:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:34:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-25 03:34:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:43,651 INFO L225 Difference]: With dead ends: 41 [2023-12-25 03:34:43,651 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 03:34:43,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:34:43,652 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:43,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 86 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:34:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 03:34:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-12-25 03:34:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:34:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-12-25 03:34:43,657 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2023-12-25 03:34:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:43,658 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-12-25 03:34:43,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:34:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-12-25 03:34:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 03:34:43,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:43,658 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:43,662 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 03:34:43,860 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 03:34:43,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:43,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash -235147060, now seen corresponding path program 1 times [2023-12-25 03:34:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:43,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3757058] [2023-12-25 03:34:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:43,861 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 03:34:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:43,863 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 03:34:43,866 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 03:34:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:43,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:34:43,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 03:34:43,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:43,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3757058] [2023-12-25 03:34:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3757058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:34:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679758263] [2023-12-25 03:34:43,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:43,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:34:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:34:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:34:43,961 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:34:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:44,137 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2023-12-25 03:34:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:34:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 03:34:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:44,138 INFO L225 Difference]: With dead ends: 60 [2023-12-25 03:34:44,138 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 03:34:44,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:34:44,140 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:44,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:34:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 03:34:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 03:34:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:34:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-25 03:34:44,149 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2023-12-25 03:34:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:44,149 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-25 03:34:44,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:34:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-25 03:34:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 03:34:44,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:44,150 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:44,155 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 03:34:44,353 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 03:34:44,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:44,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2012527405, now seen corresponding path program 1 times [2023-12-25 03:34:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40056679] [2023-12-25 03:34:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:44,355 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 03:34:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:44,356 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 03:34:44,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:34:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:44,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:34:44,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:34:44,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:34:44,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40056679] [2023-12-25 03:34:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40056679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:34:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:34:44,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:34:44,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270069522] [2023-12-25 03:34:44,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:44,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:34:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:34:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:34:44,491 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:34:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:44,631 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-12-25 03:34:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:34:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 03:34:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:44,632 INFO L225 Difference]: With dead ends: 59 [2023-12-25 03:34:44,632 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 03:34:44,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:34:44,633 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:44,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:34:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 03:34:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-25 03:34:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 03:34:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2023-12-25 03:34:44,652 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 25 [2023-12-25 03:34:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:44,652 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2023-12-25 03:34:44,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:34:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2023-12-25 03:34:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 03:34:44,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:44,653 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:44,656 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 03:34:44,853 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 03:34:44,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:44,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 292094342, now seen corresponding path program 1 times [2023-12-25 03:34:44,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:44,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281214702] [2023-12-25 03:34:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:44,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:34:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:44,856 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 03:34:44,857 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 03:34:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:44,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:34:44,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 03:34:44,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:34:45,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281214702] [2023-12-25 03:34:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281214702] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:45,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:45,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 03:34:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820759073] [2023-12-25 03:34:45,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:45,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:34:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:34:45,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:34:45,005 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:34:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:45,339 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2023-12-25 03:34:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 03:34:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32 [2023-12-25 03:34:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:45,342 INFO L225 Difference]: With dead ends: 139 [2023-12-25 03:34:45,342 INFO L226 Difference]: Without dead ends: 114 [2023-12-25 03:34:45,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:34:45,343 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:45,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:34:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-25 03:34:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2023-12-25 03:34:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 72 states have internal predecessors, (84), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-25 03:34:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-12-25 03:34:45,357 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 32 [2023-12-25 03:34:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:45,357 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-12-25 03:34:45,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:34:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-12-25 03:34:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 03:34:45,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:45,358 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-25 03:34:45,362 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 03:34:45,562 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 03:34:45,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:45,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 747162997, now seen corresponding path program 1 times [2023-12-25 03:34:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882570607] [2023-12-25 03:34:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:45,563 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 03:34:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:45,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:34:45,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 03:34:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:45,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:34:45,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:34:45,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:34:46,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882570607] [2023-12-25 03:34:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882570607] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:34:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:34:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-25 03:34:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074367608] [2023-12-25 03:34:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:34:46,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:34:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:34:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:34:46,304 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:34:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:47,086 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2023-12-25 03:34:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:34:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-25 03:34:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:47,089 INFO L225 Difference]: With dead ends: 124 [2023-12-25 03:34:47,089 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 03:34:47,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:34:47,090 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:47,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 03:34:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 03:34:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-12-25 03:34:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 79 states have internal predecessors, (90), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 03:34:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2023-12-25 03:34:47,109 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 35 [2023-12-25 03:34:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:47,110 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2023-12-25 03:34:47,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:34:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2023-12-25 03:34:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 03:34:47,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:47,116 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:47,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 03:34:47,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:34:47,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:47,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1125945480, now seen corresponding path program 1 times [2023-12-25 03:34:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331698185] [2023-12-25 03:34:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:47,320 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 03:34:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:47,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:34:47,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:34:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:47,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 03:34:47,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 03:34:47,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 03:34:47,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331698185] [2023-12-25 03:34:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331698185] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:47,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-25 03:34:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481114767] [2023-12-25 03:34:47,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 03:34:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 03:34:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:34:47,550 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 03:34:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:48,267 INFO L93 Difference]: Finished difference Result 240 states and 293 transitions. [2023-12-25 03:34:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:34:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 48 [2023-12-25 03:34:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:48,270 INFO L225 Difference]: With dead ends: 240 [2023-12-25 03:34:48,270 INFO L226 Difference]: Without dead ends: 219 [2023-12-25 03:34:48,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:34:48,271 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:48,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 185 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 03:34:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-25 03:34:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2023-12-25 03:34:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 137 states have (on average 1.197080291970803) internal successors, (164), 146 states have internal predecessors, (164), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 03:34:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 258 transitions. [2023-12-25 03:34:48,297 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 258 transitions. Word has length 48 [2023-12-25 03:34:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:48,298 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 258 transitions. [2023-12-25 03:34:48,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 03:34:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 258 transitions. [2023-12-25 03:34:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 03:34:48,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:48,298 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:48,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 03:34:48,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:34:48,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:48,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1450073182, now seen corresponding path program 1 times [2023-12-25 03:34:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451947584] [2023-12-25 03:34:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:34:48,503 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 03:34:48,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:48,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:34:48,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:34:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:34:48,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:34:48,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:34:49,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:34:58,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451947584] [2023-12-25 03:34:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451947584] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:58,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 03:34:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947905580] [2023-12-25 03:34:58,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:58,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 03:34:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:58,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 03:34:58,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:34:58,875 INFO L87 Difference]: Start difference. First operand 212 states and 258 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:35:09,484 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:35:11,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:19,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:25,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:31,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:35,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:40,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:47,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:59,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:03,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:28,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:29,416 INFO L93 Difference]: Finished difference Result 395 states and 513 transitions. [2023-12-25 03:36:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 03:36:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2023-12-25 03:36:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:29,453 INFO L225 Difference]: With dead ends: 395 [2023-12-25 03:36:29,453 INFO L226 Difference]: Without dead ends: 319 [2023-12-25 03:36:29,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2023-12-25 03:36:29,454 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 73 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 78 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:29,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 299 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 269 Invalid, 8 Unknown, 0 Unchecked, 53.2s Time] [2023-12-25 03:36:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-25 03:36:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2023-12-25 03:36:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 185 states have (on average 1.2216216216216216) internal successors, (226), 194 states have internal predecessors, (226), 59 states have call successors, (59), 31 states have call predecessors, (59), 31 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-25 03:36:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 341 transitions. [2023-12-25 03:36:29,504 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 341 transitions. Word has length 57 [2023-12-25 03:36:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:29,505 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 341 transitions. [2023-12-25 03:36:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:36:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 341 transitions. [2023-12-25 03:36:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-25 03:36:29,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:29,508 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:29,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:29,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:29,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1715906499, now seen corresponding path program 1 times [2023-12-25 03:36:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281981043] [2023-12-25 03:36:29,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:29,710 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 03:36:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:29,711 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:29,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 03:36:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:29,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 03:36:29,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 03:36:30,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:31,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281981043] [2023-12-25 03:36:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281981043] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:36:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955713960] [2023-12-25 03:36:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:36:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:36:31,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:36:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-25 03:36:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:31,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:36:31,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:36:32,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:36:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1955713960] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:36:39,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:36:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2023-12-25 03:36:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381164870] [2023-12-25 03:36:39,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:36:39,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 03:36:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 03:36:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2023-12-25 03:36:39,122 INFO L87 Difference]: Start difference. First operand 276 states and 341 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 11 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:37:06,581 WARN L293 SmtUtils]: Spent 20.87s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:37:09,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:11,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:15,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:23,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:24,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:38,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:37:38,665 INFO L93 Difference]: Finished difference Result 362 states and 454 transitions. [2023-12-25 03:37:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 03:37:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 11 states have call predecessors, (30), 12 states have call successors, (30) Word has length 68 [2023-12-25 03:37:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:37:38,700 INFO L225 Difference]: With dead ends: 362 [2023-12-25 03:37:38,700 INFO L226 Difference]: Without dead ends: 260 [2023-12-25 03:37:38,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 03:37:38,701 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 70 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:37:38,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 347 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 313 Invalid, 3 Unknown, 0 Unchecked, 25.1s Time] [2023-12-25 03:37:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-25 03:37:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 223. [2023-12-25 03:37:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 154 states have internal predecessors, (176), 45 states have call successors, (45), 29 states have call predecessors, (45), 28 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 03:37:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 263 transitions. [2023-12-25 03:37:38,728 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 263 transitions. Word has length 68 [2023-12-25 03:37:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:37:38,728 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 263 transitions. [2023-12-25 03:37:38,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 11 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:37:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 263 transitions. [2023-12-25 03:37:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 03:37:38,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:37:38,729 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:37:38,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-25 03:37:38,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 03:37:39,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:37:39,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:37:39,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:37:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -319401384, now seen corresponding path program 1 times [2023-12-25 03:37:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:37:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313149706] [2023-12-25 03:37:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:37:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:37:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:37:39,135 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:37:39,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 03:37:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:37:39,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:37:39,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:37:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-25 03:37:39,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:37:39,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:37:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313149706] [2023-12-25 03:37:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313149706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:37:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:37:39,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:37:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986849422] [2023-12-25 03:37:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:37:39,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:37:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:37:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:37:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:37:39,312 INFO L87 Difference]: Start difference. First operand 223 states and 263 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:37:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:37:39,415 INFO L93 Difference]: Finished difference Result 248 states and 289 transitions. [2023-12-25 03:37:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:37:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2023-12-25 03:37:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:37:39,417 INFO L225 Difference]: With dead ends: 248 [2023-12-25 03:37:39,417 INFO L226 Difference]: Without dead ends: 218 [2023-12-25 03:37:39,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:37:39,418 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:37:39,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:37:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-25 03:37:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2023-12-25 03:37:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.1724137931034482) internal successors, (170), 149 states have internal predecessors, (170), 43 states have call successors, (43), 27 states have call predecessors, (43), 27 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-25 03:37:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2023-12-25 03:37:39,452 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 77 [2023-12-25 03:37:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:37:39,453 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2023-12-25 03:37:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:37:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2023-12-25 03:37:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 03:37:39,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:37:39,453 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:37:39,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 03:37:39,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:37:39,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:37:39,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:37:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1624177683, now seen corresponding path program 2 times [2023-12-25 03:37:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:37:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44141048] [2023-12-25 03:37:39,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:37:39,658 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 03:37:39,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:37:39,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:37:39,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 03:37:39,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:37:39,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:37:39,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 03:37:39,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:37:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 03:37:40,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:37:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 03:37:46,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:37:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44141048] [2023-12-25 03:37:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44141048] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:37:46,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:37:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-12-25 03:37:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712039977] [2023-12-25 03:37:46,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:37:46,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 03:37:46,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:37:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 03:37:46,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:37:46,735 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 11 states have internal predecessors, (40), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-25 03:37:54,926 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:38:00,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:10,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:14,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:18,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:22,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:26,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:30,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:34,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:38,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:42,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:46,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:51,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:55,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:01,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:10,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:14,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:18,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:23,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:24,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:29,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:33,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:37,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:37,589 INFO L93 Difference]: Finished difference Result 317 states and 398 transitions. [2023-12-25 03:39:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:39:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 11 states have internal predecessors, (40), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 80 [2023-12-25 03:39:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:37,591 INFO L225 Difference]: With dead ends: 317 [2023-12-25 03:39:37,591 INFO L226 Difference]: Without dead ends: 261 [2023-12-25 03:39:37,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2023-12-25 03:39:37,592 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 44 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 35 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:37,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 351 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 247 Invalid, 22 Unknown, 0 Unchecked, 97.4s Time] [2023-12-25 03:39:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-25 03:39:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2023-12-25 03:39:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 54 states have call successors, (54), 30 states have call predecessors, (54), 30 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-25 03:39:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 297 transitions. [2023-12-25 03:39:37,625 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 297 transitions. Word has length 80 [2023-12-25 03:39:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:37,625 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 297 transitions. [2023-12-25 03:39:37,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 11 states have internal predecessors, (40), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-25 03:39:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 297 transitions. [2023-12-25 03:39:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-25 03:39:37,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:37,626 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-12-25 03:39:37,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-25 03:39:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:37,831 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1153550505, now seen corresponding path program 3 times [2023-12-25 03:39:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406638568] [2023-12-25 03:39:37,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:39:37,832 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 03:39:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:37,833 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:39:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 03:39:37,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:39:37,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:39:37,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 03:39:37,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:39:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 90 proven. 32 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 03:39:40,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:40:14,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:40:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406638568] [2023-12-25 03:40:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406638568] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:40:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483825974] [2023-12-25 03:40:14,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:40:14,823 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:40:14,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:40:14,824 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:40:14,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-25 03:40:14,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:40:14,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:40:14,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 03:40:14,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:40:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 58 proven. 34 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 03:40:17,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:41:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 58 proven. 34 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 03:41:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483825974] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:41:38,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:41:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-12-25 03:41:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362042006] [2023-12-25 03:41:38,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:41:38,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 03:41:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:41:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 03:41:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=836, Unknown=6, NotChecked=0, Total=1056 [2023-12-25 03:41:38,333 INFO L87 Difference]: Start difference. First operand 249 states and 297 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 26 states have internal predecessors, (71), 16 states have call successors, (41), 3 states have call predecessors, (41), 2 states have return successors, (39), 12 states have call predecessors, (39), 14 states have call successors, (39) [2023-12-25 03:42:38,350 WARN L293 SmtUtils]: Spent 40.09s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:42:46,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:42:51,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:42:53,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:43:12,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:02,560 WARN L293 SmtUtils]: Spent 1.53m on a formula simplification. DAG size of input: 105 DAG size of output: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:45:04,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:05,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:10,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:14,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:29,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:33,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:38,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:00,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:02,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:23,465 WARN L293 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:46:27,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:31,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:42,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:47,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:49,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:53,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:07,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:14,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:19,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:47,291 WARN L293 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:47:52,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:56,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:09,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:12,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:13,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:46,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:48,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:02,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:04,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:09,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:17,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:23,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 03:49:25,630 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 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:49:25,631 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 03:49:25,631 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:49:26,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 03:49:26,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-25 03:49:26,838 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 03:49:26,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 406.3s TimeCoverageRelationStatistics Valid=539, Invalid=2003, Unknown=8, NotChecked=0, Total=2550 [2023-12-25 03:49:26,863 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 126 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 129 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:49:26,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 724 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 581 Invalid, 15 Unknown, 0 Unchecked, 146.0s Time] [2023-12-25 03:49:26,864 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:49:26,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 03:49:26,865 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 03:49:26,868 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:49:26,870 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:49:26,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:49:26 BoogieIcfgContainer [2023-12-25 03:49:26,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:49:26,871 INFO L158 Benchmark]: Toolchain (without parser) took 885131.99ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 159.4MB in the beginning and 134.4MB in the end (delta: 25.0MB). Peak memory consumption was 67.2MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,871 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 202.4MB. Free memory was 158.6MB in the beginning and 158.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:49:26,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.88ms. Allocated memory is still 202.4MB. Free memory was 159.4MB in the beginning and 147.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.74ms. Allocated memory is still 202.4MB. Free memory was 147.6MB in the beginning and 146.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,872 INFO L158 Benchmark]: Boogie Preprocessor took 26.30ms. Allocated memory is still 202.4MB. Free memory was 145.9MB in the beginning and 144.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,872 INFO L158 Benchmark]: RCFGBuilder took 280.94ms. Allocated memory is still 202.4MB. Free memory was 144.1MB in the beginning and 130.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,872 INFO L158 Benchmark]: TraceAbstraction took 884624.26ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 129.8MB in the beginning and 134.4MB in the end (delta: -4.6MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2023-12-25 03:49:26,873 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 202.4MB. Free memory was 158.6MB in the beginning and 158.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.88ms. Allocated memory is still 202.4MB. Free memory was 159.4MB in the beginning and 147.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.74ms. Allocated memory is still 202.4MB. Free memory was 147.6MB in the beginning and 146.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.30ms. Allocated memory is still 202.4MB. Free memory was 145.9MB in the beginning and 144.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.94ms. Allocated memory is still 202.4MB. Free memory was 144.1MB in the beginning and 130.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 884624.26ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 129.8MB in the beginning and 134.4MB in the end (delta: -4.6MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.6s, OverallIterations: 14, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 732.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 323.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 2659 SdHoareTripleChecker+Invalid, 313.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2210 mSDsCounter, 390 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1779 IncrementalHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 390 mSolverCounterUnsat, 449 mSDtfsCounter, 1779 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 1027 SyntacticMatches, 4 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 506.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=10, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 128 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 148.1s InterpolantComputationTime, 720 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1106 ConstructedInterpolants, 11 QuantifiedInterpolants, 6678 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 3095/3351 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