/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/egcd3-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:58:54,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:58:54,213 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 01:58:54,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:58:54,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:58:54,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:58:54,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:58:54,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:58:54,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:58:54,244 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:58:54,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:58:54,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:58:54,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:58:54,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:58:54,246 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:58:54,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:58:54,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:58:54,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:58:54,248 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:58:54,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:58:54,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:58:54,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:58:54,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:58:54,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:58:54,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:58:54,251 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:58:54,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:58:54,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:58:54,251 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:58:54,251 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 01:58:54,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:58:54,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:58:54,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:58:54,457 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:58:54,465 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:58:54,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2023-12-25 01:58:55,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:58:55,721 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:58:55,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2023-12-25 01:58:55,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854e9613a/abac8e275c834ff7b04797c0a5d54b3d/FLAG6e7535be3 [2023-12-25 01:58:55,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854e9613a/abac8e275c834ff7b04797c0a5d54b3d [2023-12-25 01:58:55,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:58:55,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:58:55,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:58:55,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:58:55,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:58:55,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf36112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55, skipping insertion in model container [2023-12-25 01:58:55,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:58:55,861 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/egcd3-ll_unwindbound50.c[490,503] [2023-12-25 01:58:55,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:58:55,884 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:58:55,893 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/egcd3-ll_unwindbound50.c[490,503] [2023-12-25 01:58:55,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:58:55,911 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:58:55,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55 WrapperNode [2023-12-25 01:58:55,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:58:55,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:58:55,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:58:55,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:58:55,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,950 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2023-12-25 01:58:55,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:58:55,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:58:55,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:58:55,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:58:55,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,990 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:58:55,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:58:55,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:58:55,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:58:55,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:58:56,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:56,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:58:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:58:56,044 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 01:58:56,049 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 01:58:56,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:58:56,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:58:56,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:58:56,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:58:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:58:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:58:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:58:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:58:56,151 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:58:56,156 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:58:56,442 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:58:56,462 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:58:56,462 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 01:58:56,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:58:56 BoogieIcfgContainer [2023-12-25 01:58:56,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:58:56,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:58:56,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:58:56,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:58:56,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:58:55" (1/3) ... [2023-12-25 01:58:56,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729afcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:58:56, skipping insertion in model container [2023-12-25 01:58:56,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55" (2/3) ... [2023-12-25 01:58:56,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729afcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:58:56, skipping insertion in model container [2023-12-25 01:58:56,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:58:56" (3/3) ... [2023-12-25 01:58:56,469 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound50.c [2023-12-25 01:58:56,480 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:58:56,480 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:58:56,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:58:56,513 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;@68b39dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:58:56,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:58:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 01:58:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 01:58:56,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:56,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:56,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:56,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash -832436526, now seen corresponding path program 1 times [2023-12-25 01:58:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617274011] [2023-12-25 01:58:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:56,533 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 01:58:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:56,535 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 01:58:56,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:58:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:56,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:58:56,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 01:58:56,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:56,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617274011] [2023-12-25 01:58:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617274011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:58:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290877182] [2023-12-25 01:58:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:56,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:58:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:56,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:58:56,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:58:56,715 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:58:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:56,745 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2023-12-25 01:58:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:58:56,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 01:58:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:56,762 INFO L225 Difference]: With dead ends: 62 [2023-12-25 01:58:56,762 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 01:58:56,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 01:58:56,770 INFO L413 NwaCegarLoop]: 40 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, 40 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 01:58:56,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:58:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 01:58:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 01:58:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 01:58:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-12-25 01:58:56,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2023-12-25 01:58:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:56,801 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-12-25 01:58:56,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:58:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-12-25 01:58:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:58:56,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:56,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:56,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:58:57,009 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 01:58:57,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:57,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 958862887, now seen corresponding path program 1 times [2023-12-25 01:58:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028812409] [2023-12-25 01:58:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:57,011 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 01:58:57,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:57,015 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 01:58:57,016 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 01:58:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:57,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 01:58:57,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:58:57,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:57,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:57,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028812409] [2023-12-25 01:58:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028812409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:57,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:58:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589359409] [2023-12-25 01:58:57,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:57,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 01:58:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:57,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 01:58:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:58:57,210 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 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 01:58:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:57,249 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-25 01:58:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 01:58:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 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 18 [2023-12-25 01:58:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:57,250 INFO L225 Difference]: With dead ends: 39 [2023-12-25 01:58:57,250 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 01:58:57,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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 01:58:57,251 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:58:57,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:58:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 01:58:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 01:58:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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 01:58:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-25 01:58:57,257 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2023-12-25 01:58:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:57,261 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-25 01:58:57,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 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 01:58:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-25 01:58:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-25 01:58:57,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:57,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:57,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 01:58:57,462 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 01:58:57,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:57,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -359656705, now seen corresponding path program 1 times [2023-12-25 01:58:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915899782] [2023-12-25 01:58:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:57,464 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 01:58:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:57,466 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 01:58:57,469 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 01:58:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:57,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:58:57,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:58:57,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:57,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915899782] [2023-12-25 01:58:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915899782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 01:58:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830168921] [2023-12-25 01:58:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:57,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:58:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:58:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:58:57,701 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:58:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:58,280 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2023-12-25 01:58:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:58:58,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-25 01:58:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:58,286 INFO L225 Difference]: With dead ends: 52 [2023-12-25 01:58:58,286 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 01:58:58,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:58:58,287 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:58:58,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 129 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 01:58:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 01:58:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2023-12-25 01:58:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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 01:58:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2023-12-25 01:58:58,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2023-12-25 01:58:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:58,294 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2023-12-25 01:58:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:58:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2023-12-25 01:58:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 01:58:58,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:58,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:58,307 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 01:58:58,501 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 01:58:58,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:58,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1735129581, now seen corresponding path program 1 times [2023-12-25 01:58:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:58,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058586687] [2023-12-25 01:58:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:58,505 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 01:58:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:58,506 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 01:58:58,512 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 01:58:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:58,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:58:58,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:58:58,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:58,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058586687] [2023-12-25 01:58:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058586687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 01:58:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639648521] [2023-12-25 01:58:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:58,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:58:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:58,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:58:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:58:58,769 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 01:58:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:58,820 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2023-12-25 01:58:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:58:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 24 [2023-12-25 01:58:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:58,821 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:58:58,821 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 01:58:58,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:58:58,822 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:58:58,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:58:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 01:58:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 01:58:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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 01:58:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-12-25 01:58:58,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 24 [2023-12-25 01:58:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:58,828 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-12-25 01:58:58,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 01:58:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-12-25 01:58:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 01:58:58,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:58,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:58,850 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 01:58:59,029 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 01:58:59,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:59,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash 150917056, now seen corresponding path program 1 times [2023-12-25 01:58:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777764764] [2023-12-25 01:58:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:59,031 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 01:58:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:59,032 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 01:58:59,035 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 01:58:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:59,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:58:59,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:58:59,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:59,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777764764] [2023-12-25 01:58:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777764764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 01:58:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846167779] [2023-12-25 01:58:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 01:58:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 01:58:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:58:59,476 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:59:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:01,695 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2023-12-25 01:59:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:59:01,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-12-25 01:59:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:01,706 INFO L225 Difference]: With dead ends: 53 [2023-12-25 01:59:01,706 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 01:59:01,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:59:01,707 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:01,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 176 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 01:59:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 01:59:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-25 01:59:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:59:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2023-12-25 01:59:01,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2023-12-25 01:59:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:01,722 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2023-12-25 01:59:01,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:59:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2023-12-25 01:59:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 01:59:01,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:01,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:01,734 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 01:59:01,931 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 01:59:01,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:01,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1833090586, now seen corresponding path program 1 times [2023-12-25 01:59:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:01,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058883684] [2023-12-25 01:59:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:01,933 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 01:59:01,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:01,934 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 01:59:01,947 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 01:59:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:02,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:59:02,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:59:02,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:59:02,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058883684] [2023-12-25 01:59:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058883684] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:59:02,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:59:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-25 01:59:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914387309] [2023-12-25 01:59:02,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:59:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:59:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:59:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:59:02,397 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:59:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:09,099 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2023-12-25 01:59:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:59:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-12-25 01:59:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:09,108 INFO L225 Difference]: With dead ends: 146 [2023-12-25 01:59:09,108 INFO L226 Difference]: Without dead ends: 139 [2023-12-25 01:59:09,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:59:09,109 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:09,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 236 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-25 01:59:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-25 01:59:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 96. [2023-12-25 01:59:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.338235294117647) internal successors, (91), 70 states have internal predecessors, (91), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:59:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2023-12-25 01:59:09,143 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 25 [2023-12-25 01:59:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:09,143 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2023-12-25 01:59:09,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:59:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2023-12-25 01:59:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-25 01:59:09,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:09,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:09,160 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 01:59:09,363 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 01:59:09,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:09,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1010868448, now seen corresponding path program 1 times [2023-12-25 01:59:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:09,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746410343] [2023-12-25 01:59:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:09,366 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 01:59:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:09,368 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 01:59:09,372 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 01:59:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:09,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:59:09,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:59:09,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:59:10,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:10,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746410343] [2023-12-25 01:59:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746410343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:59:10,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:59:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 01:59:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635495899] [2023-12-25 01:59:10,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:59:10,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 01:59:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 01:59:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:59:10,485 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:59:16,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:59:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:16,932 INFO L93 Difference]: Finished difference Result 186 states and 266 transitions. [2023-12-25 01:59:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:59:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-12-25 01:59:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:16,941 INFO L225 Difference]: With dead ends: 186 [2023-12-25 01:59:16,941 INFO L226 Difference]: Without dead ends: 174 [2023-12-25 01:59:16,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:59:16,942 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 331 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:16,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 274 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 01:59:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-25 01:59:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2023-12-25 01:59:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:59:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2023-12-25 01:59:16,971 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 26 [2023-12-25 01:59:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:16,973 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2023-12-25 01:59:16,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:59:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2023-12-25 01:59:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 01:59:16,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:16,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:16,990 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 01:59:17,188 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 01:59:17,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:17,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2130442992, now seen corresponding path program 1 times [2023-12-25 01:59:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:17,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317540278] [2023-12-25 01:59:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:59:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:17,190 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 01:59:17,191 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 01:59:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:17,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:59:17,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:59:17,779 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:59:17,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317540278] [2023-12-25 01:59:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317540278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:59:17,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:59:17,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 01:59:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090319905] [2023-12-25 01:59:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:17,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 01:59:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:17,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 01:59:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:59:17,781 INFO L87 Difference]: Start difference. First operand 105 states and 140 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:59:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:20,182 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2023-12-25 01:59:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:59:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-12-25 01:59:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:20,194 INFO L225 Difference]: With dead ends: 120 [2023-12-25 01:59:20,194 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 01:59:20,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:59:20,196 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 01:59:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 01:59:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-12-25 01:59:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 88 states have internal predecessors, (112), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:59:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-12-25 01:59:20,212 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 29 [2023-12-25 01:59:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:20,212 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-12-25 01:59:20,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:59:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-12-25 01:59:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 01:59:20,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:20,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:20,233 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 01:59:20,421 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 01:59:20,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:20,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2110713919, now seen corresponding path program 1 times [2023-12-25 01:59:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648468608] [2023-12-25 01:59:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:20,422 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 01:59:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:20,429 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 01:59:20,429 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 01:59:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:20,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:59:20,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:59:21,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:59:37,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648468608] [2023-12-25 01:59:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648468608] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:59:37,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:59:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 01:59:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531388871] [2023-12-25 01:59:37,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:59:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:59:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:59:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:59:37,764 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:59:48,138 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 [] [2023-12-25 01:59:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:59,738 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-12-25 01:59:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:59:59,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2023-12-25 01:59:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:59,766 INFO L225 Difference]: With dead ends: 144 [2023-12-25 01:59:59,766 INFO L226 Difference]: Without dead ends: 142 [2023-12-25 01:59:59,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:59:59,767 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:59,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 364 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 17.7s Time] [2023-12-25 01:59:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-25 01:59:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2023-12-25 01:59:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 01:59:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 182 transitions. [2023-12-25 01:59:59,787 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 182 transitions. Word has length 31 [2023-12-25 01:59:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:59,787 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 182 transitions. [2023-12-25 01:59:59,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:59:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2023-12-25 01:59:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 01:59:59,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:59,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:59,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:59:59,993 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 01:59:59,994 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:59,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -363027956, now seen corresponding path program 1 times [2023-12-25 01:59:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992551103] [2023-12-25 01:59:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:59,995 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 01:59:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:59,997 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 01:59:59,998 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 02:00:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:00,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 02:00:00,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:00:00,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:00:00,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992551103] [2023-12-25 02:00:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992551103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:00:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:00:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 02:00:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915227254] [2023-12-25 02:00:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 02:00:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 02:00:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 02:00:00,345 INFO L87 Difference]: Start difference. First operand 139 states and 182 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 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 02:00:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:00,472 INFO L93 Difference]: Finished difference Result 216 states and 290 transitions. [2023-12-25 02:00:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:00:00,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 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 31 [2023-12-25 02:00:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:00,475 INFO L225 Difference]: With dead ends: 216 [2023-12-25 02:00:00,475 INFO L226 Difference]: Without dead ends: 139 [2023-12-25 02:00:00,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 02:00:00,478 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:00,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 02:00:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-25 02:00:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-12-25 02:00:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 02:00:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2023-12-25 02:00:00,503 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 31 [2023-12-25 02:00:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:00,503 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2023-12-25 02:00:00,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 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 02:00:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2023-12-25 02:00:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:00:00,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:00,504 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:00,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 02:00:00,713 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 02:00:00,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:00,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -242784896, now seen corresponding path program 1 times [2023-12-25 02:00:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:00,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696028799] [2023-12-25 02:00:00,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:00,714 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 02:00:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:00,716 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 02:00:00,717 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 02:00:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:00,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 02:00:00,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 02:00:01,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:00:01,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:00:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696028799] [2023-12-25 02:00:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696028799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:00:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:00:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 02:00:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392392583] [2023-12-25 02:00:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:00:01,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 02:00:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:00:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 02:00:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-25 02:00:01,874 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 02:00:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:00:05,196 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2023-12-25 02:00:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 02:00:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2023-12-25 02:00:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:00:05,207 INFO L225 Difference]: With dead ends: 208 [2023-12-25 02:00:05,207 INFO L226 Difference]: Without dead ends: 206 [2023-12-25 02:00:05,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:00:05,208 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 122 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:00:05,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 176 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-25 02:00:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-25 02:00:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 179. [2023-12-25 02:00:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 129 states have (on average 1.317829457364341) internal successors, (170), 130 states have internal predecessors, (170), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 02:00:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 239 transitions. [2023-12-25 02:00:05,241 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 239 transitions. Word has length 34 [2023-12-25 02:00:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:00:05,241 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 239 transitions. [2023-12-25 02:00:05,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 02:00:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 239 transitions. [2023-12-25 02:00:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 02:00:05,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:00:05,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:05,272 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 (12)] Ended with exit code 0 [2023-12-25 02:00:05,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:00:05,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:00:05,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:00:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -568879, now seen corresponding path program 1 times [2023-12-25 02:00:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:00:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749005753] [2023-12-25 02:00:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:00:05,453 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 02:00:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:00:05,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:00:05,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 02:00:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:00:05,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:00:05,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:00:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:00:07,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:01:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:01:07,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:01:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749005753] [2023-12-25 02:01:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749005753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:01:07,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:01:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-25 02:01:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478124165] [2023-12-25 02:01:07,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:01:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 02:01:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:01:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 02:01:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 02:01:07,747 INFO L87 Difference]: Start difference. First operand 179 states and 239 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 02:01:10,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:16,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:34,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:38,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:01:58,415 WARN L293 SmtUtils]: Spent 6.05s 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 02:02:34,597 WARN L293 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:02:46,593 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 02:03:18,489 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:03:22,583 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 02:03:26,588 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 02:03:28,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:40,862 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 02:03:43,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:50,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:03:54,580 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 02:03:57,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:02,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:03,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:05,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:08,489 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 02:04:12,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:16,944 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 02:04:18,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:21,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:25,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:28,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:31,231 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 02:04:33,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:35,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:41,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:43,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:45,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:04:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:04:45,507 INFO L93 Difference]: Finished difference Result 280 states and 389 transitions. [2023-12-25 02:04:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 02:04:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2023-12-25 02:04:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:04:45,616 INFO L225 Difference]: With dead ends: 280 [2023-12-25 02:04:45,616 INFO L226 Difference]: Without dead ends: 278 [2023-12-25 02:04:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 156.4s TimeCoverageRelationStatistics Valid=138, Invalid=563, Unknown=1, NotChecked=0, Total=702 [2023-12-25 02:04:45,617 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 264 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 103 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:04:45,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 374 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 102.8s Time] [2023-12-25 02:04:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-12-25 02:04:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 253. [2023-12-25 02:04:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.3532608695652173) internal successors, (249), 185 states have internal predecessors, (249), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-25 02:04:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 350 transitions. [2023-12-25 02:04:45,666 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 350 transitions. Word has length 36 [2023-12-25 02:04:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:04:45,666 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 350 transitions. [2023-12-25 02:04:45,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 02:04:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2023-12-25 02:04:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 02:04:45,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:04:45,668 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:04:45,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 02:04:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:04:45,877 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:04:45,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:04:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 895823024, now seen corresponding path program 1 times [2023-12-25 02:04:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:04:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580483638] [2023-12-25 02:04:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:04:45,878 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 02:04:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:04:45,880 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 02:04:45,881 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 02:04:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:04:46,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 02:04:46,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:04:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 02:04:46,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:04:46,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:04:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580483638] [2023-12-25 02:04:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580483638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:04:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:04:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 02:04:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22943098] [2023-12-25 02:04:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:04:46,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 02:04:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:04:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 02:04:46,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-25 02:04:46,932 INFO L87 Difference]: Start difference. First operand 253 states and 350 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:04:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:04:51,493 INFO L93 Difference]: Finished difference Result 268 states and 370 transitions. [2023-12-25 02:04:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 02:04:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2023-12-25 02:04:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:04:51,496 INFO L225 Difference]: With dead ends: 268 [2023-12-25 02:04:51,496 INFO L226 Difference]: Without dead ends: 266 [2023-12-25 02:04:51,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-25 02:04:51,497 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:04:51,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-25 02:04:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-25 02:04:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2023-12-25 02:04:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 189 states have (on average 1.343915343915344) internal successors, (254), 191 states have internal predecessors, (254), 55 states have call successors, (55), 18 states have call predecessors, (55), 18 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 02:04:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 363 transitions. [2023-12-25 02:04:51,556 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 363 transitions. Word has length 39 [2023-12-25 02:04:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:04:51,556 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 363 transitions. [2023-12-25 02:04:51,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 02:04:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2023-12-25 02:04:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 02:04:51,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:04:51,557 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:04:51,580 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 02:04:51,780 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 02:04:51,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:04:51,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:04:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 184539710, now seen corresponding path program 1 times [2023-12-25 02:04:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:04:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706662236] [2023-12-25 02:04:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:04:51,781 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 02:04:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:04:51,782 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 02:04:51,790 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 02:04:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:04:52,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 02:04:52,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:04:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 02:04:52,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:04:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 02:04:53,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:04:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706662236] [2023-12-25 02:04:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706662236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:04:53,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:04:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-25 02:04:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975843187] [2023-12-25 02:04:53,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:04:53,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 02:04:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:04:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 02:04:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:04:53,107 INFO L87 Difference]: Start difference. First operand 263 states and 363 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:05:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:05:05,694 INFO L93 Difference]: Finished difference Result 684 states and 934 transitions. [2023-12-25 02:05:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 02:05:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-12-25 02:05:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:05:05,711 INFO L225 Difference]: With dead ends: 684 [2023-12-25 02:05:05,711 INFO L226 Difference]: Without dead ends: 554 [2023-12-25 02:05:05,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2023-12-25 02:05:05,712 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 143 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-12-25 02:05:05,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 284 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-12-25 02:05:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2023-12-25 02:05:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 522. [2023-12-25 02:05:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 364 states have (on average 1.2884615384615385) internal successors, (469), 371 states have internal predecessors, (469), 114 states have call successors, (114), 43 states have call predecessors, (114), 43 states have return successors, (110), 107 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-25 02:05:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 693 transitions. [2023-12-25 02:05:05,809 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 693 transitions. Word has length 37 [2023-12-25 02:05:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:05:05,809 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 693 transitions. [2023-12-25 02:05:05,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:05:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 693 transitions. [2023-12-25 02:05:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 02:05:05,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:05:05,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:05:05,826 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 02:05:06,024 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 02:05:06,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:05:06,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:05:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 869918208, now seen corresponding path program 1 times [2023-12-25 02:05:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:05:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494648158] [2023-12-25 02:05:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:05:06,025 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 02:05:06,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:05:06,026 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 02:05:06,027 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 02:05:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:05:06,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 02:05:06,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:05:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:05:06,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:05:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:05:07,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:05:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494648158] [2023-12-25 02:05:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494648158] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:05:07,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:05:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 02:05:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24967878] [2023-12-25 02:05:07,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:05:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:05:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:05:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:05:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:05:07,422 INFO L87 Difference]: Start difference. First operand 522 states and 693 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:05:18,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:23,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:05:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:05:27,058 INFO L93 Difference]: Finished difference Result 1111 states and 1503 transitions. [2023-12-25 02:05:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 02:05:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-12-25 02:05:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:05:27,075 INFO L225 Difference]: With dead ends: 1111 [2023-12-25 02:05:27,075 INFO L226 Difference]: Without dead ends: 852 [2023-12-25 02:05:27,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2023-12-25 02:05:27,079 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 216 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-12-25 02:05:27,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 480 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2023-12-25 02:05:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2023-12-25 02:05:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 810. [2023-12-25 02:05:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 564 states have (on average 1.2588652482269505) internal successors, (710), 575 states have internal predecessors, (710), 184 states have call successors, (184), 61 states have call predecessors, (184), 61 states have return successors, (178), 173 states have call predecessors, (178), 178 states have call successors, (178) [2023-12-25 02:05:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1072 transitions. [2023-12-25 02:05:27,247 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1072 transitions. Word has length 38 [2023-12-25 02:05:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:05:27,248 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 1072 transitions. [2023-12-25 02:05:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:05:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1072 transitions. [2023-12-25 02:05:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 02:05:27,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:05:27,249 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:05:27,280 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 02:05:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:05:27,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:05:27,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:05:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2022990534, now seen corresponding path program 2 times [2023-12-25 02:05:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:05:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415300237] [2023-12-25 02:05:27,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 02:05:27,462 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 02:05:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:05:27,463 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:05:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 02:05:27,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 02:05:27,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 02:05:27,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 02:05:27,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:05:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:05:28,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:05:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:05:29,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:05:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415300237] [2023-12-25 02:05:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415300237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:05:29,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:05:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-12-25 02:05:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13381310] [2023-12-25 02:05:29,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:05:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 02:05:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:05:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 02:05:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-12-25 02:05:29,631 INFO L87 Difference]: Start difference. First operand 810 states and 1072 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:05:43,778 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 02:06:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:06:01,441 INFO L93 Difference]: Finished difference Result 1586 states and 2180 transitions. [2023-12-25 02:06:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 02:06:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-25 02:06:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:06:01,461 INFO L225 Difference]: With dead ends: 1586 [2023-12-25 02:06:01,461 INFO L226 Difference]: Without dead ends: 1564 [2023-12-25 02:06:01,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=363, Invalid=827, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 02:06:01,462 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 463 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2023-12-25 02:06:01,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 866 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 29.6s Time] [2023-12-25 02:06:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2023-12-25 02:06:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1324. [2023-12-25 02:06:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 920 states have (on average 1.2847826086956522) internal successors, (1182), 937 states have internal predecessors, (1182), 315 states have call successors, (315), 88 states have call predecessors, (315), 88 states have return successors, (306), 298 states have call predecessors, (306), 306 states have call successors, (306) [2023-12-25 02:06:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1803 transitions. [2023-12-25 02:06:01,741 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1803 transitions. Word has length 39 [2023-12-25 02:06:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:06:01,741 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1803 transitions. [2023-12-25 02:06:01,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 02:06:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1803 transitions. [2023-12-25 02:06:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 02:06:01,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:06:01,742 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:06:01,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 02:06:01,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:06:01,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:06:01,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:06:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1448206767, now seen corresponding path program 1 times [2023-12-25 02:06:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:06:01,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276418966] [2023-12-25 02:06:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:06:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:06:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:06:01,944 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:06:01,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 02:06:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:06:02,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 02:06:02,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:06:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 02:06:03,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:06:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 02:06:08,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:06:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276418966] [2023-12-25 02:06:08,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276418966] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:06:08,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:06:08,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-25 02:06:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418249063] [2023-12-25 02:06:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:06:08,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:06:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:06:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:06:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:06:08,584 INFO L87 Difference]: Start difference. First operand 1324 states and 1803 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 02:06:16,293 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 02:06:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:06:18,338 INFO L93 Difference]: Finished difference Result 1600 states and 2250 transitions. [2023-12-25 02:06:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:06:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 46 [2023-12-25 02:06:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:06:18,358 INFO L225 Difference]: With dead ends: 1600 [2023-12-25 02:06:18,358 INFO L226 Difference]: Without dead ends: 1598 [2023-12-25 02:06:18,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-12-25 02:06:18,359 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:06:18,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 127 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2023-12-25 02:06:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2023-12-25 02:06:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1530. [2023-12-25 02:06:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1002 states have (on average 1.280439121756487) internal successors, (1283), 1048 states have internal predecessors, (1283), 431 states have call successors, (431), 96 states have call predecessors, (431), 96 states have return successors, (422), 385 states have call predecessors, (422), 422 states have call successors, (422) [2023-12-25 02:06:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2136 transitions. [2023-12-25 02:06:18,729 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2136 transitions. Word has length 46 [2023-12-25 02:06:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:06:18,729 INFO L495 AbstractCegarLoop]: Abstraction has 1530 states and 2136 transitions. [2023-12-25 02:06:18,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 02:06:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2136 transitions. [2023-12-25 02:06:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 02:06:18,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:06:18,730 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:06:18,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 02:06:18,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:06:18,942 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:06:18,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:06:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -263121925, now seen corresponding path program 1 times [2023-12-25 02:06:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:06:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041582554] [2023-12-25 02:06:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:06:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:06:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:06:18,944 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 02:06:18,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process Received shutdown request... [2023-12-25 02:13:41,596 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 (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:13:41,616 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 02:13:42,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-25 02:13:42,797 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forcibly destroying the process [2023-12-25 02:13:42,871 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-25 02:13:42,872 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:13:42,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:13:42,872 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 54 with TraceHistMax 5,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1041582554] and IpTcStrategyModuleCvc4 [714152691]. [2023-12-25 02:13:42,875 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:13:42,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 137 [2023-12-25 02:13:42,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:13:42,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:13:42 BoogieIcfgContainer [2023-12-25 02:13:42,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:13:42,887 INFO L158 Benchmark]: Toolchain (without parser) took 887148.07ms. Allocated memory is still 326.1MB. Free memory was 275.2MB in the beginning and 182.6MB in the end (delta: 92.6MB). Peak memory consumption was 93.8MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,887 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:13:42,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.72ms. Allocated memory is still 326.1MB. Free memory was 274.9MB in the beginning and 263.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.00ms. Allocated memory is still 326.1MB. Free memory was 263.0MB in the beginning and 261.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,900 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 326.1MB. Free memory was 261.3MB in the beginning and 259.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,901 INFO L158 Benchmark]: RCFGBuilder took 463.99ms. Allocated memory is still 326.1MB. Free memory was 259.2MB in the beginning and 245.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,902 INFO L158 Benchmark]: TraceAbstraction took 886422.17ms. Allocated memory is still 326.1MB. Free memory was 244.5MB in the beginning and 182.6MB in the end (delta: 61.9MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. [2023-12-25 02:13:42,904 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.14ms. Allocated memory is still 204.5MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.72ms. Allocated memory is still 326.1MB. Free memory was 274.9MB in the beginning and 263.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.00ms. Allocated memory is still 326.1MB. Free memory was 263.0MB in the beginning and 261.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 326.1MB. Free memory was 261.3MB in the beginning and 259.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.99ms. Allocated memory is still 326.1MB. Free memory was 259.2MB in the beginning and 245.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 886422.17ms. Allocated memory is still 326.1MB. Free memory was 244.5MB in the beginning and 182.6MB in the end (delta: 61.9MB). Peak memory consumption was 63.4MB. 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: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 54 with TraceHistMax 5,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1041582554] and IpTcStrategyModuleCvc4 [714152691]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.4s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 340.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 1908 SdHoareTripleChecker+Valid, 214.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1868 mSDsluCounter, 4286 SdHoareTripleChecker+Invalid, 200.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3566 mSDsCounter, 921 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2195 IncrementalHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 921 mSolverCounterUnsat, 720 mSDtfsCounter, 2195 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 182.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1530occurred in iteration=17, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 566 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 94.2s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 766 ConstructedInterpolants, 55 QuantifiedInterpolants, 3555 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 232/357 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