/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/ps6-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:03:52,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:03:52,609 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 05:03:52,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:03:52,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:03:52,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:03:52,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:03:52,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:03:52,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:03:52,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:03:52,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:03:52,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:03:52,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:03:52,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:03:52,639 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:03:52,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:03:52,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:03:52,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:03:52,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:03:52,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:03:52,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:03:52,642 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:03:52,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:03:52,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:03:52,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:03:52,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:03:52,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:03:52,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:03:52,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:03:52,645 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:03:52,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:03:52,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:03:52,646 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:03:52,646 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 05:03:52,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:03:52,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:03:52,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:03:52,836 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:03:52,836 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:03:52,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c [2023-12-25 05:03:53,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:03:53,895 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:03:53,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound50.c [2023-12-25 05:03:53,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d75b0203/51466a96be1e4a8baacb836b8aa475ff/FLAG73deb2802 [2023-12-25 05:03:53,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d75b0203/51466a96be1e4a8baacb836b8aa475ff [2023-12-25 05:03:53,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:03:53,912 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:03:53,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:03:53,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:03:53,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:03:53,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:03:53" (1/1) ... [2023-12-25 05:03:53,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd46377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:53, skipping insertion in model container [2023-12-25 05:03:53,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:03:53" (1/1) ... [2023-12-25 05:03:53,936 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:03:54,052 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/ps6-ll_unwindbound50.c[458,471] [2023-12-25 05:03:54,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:03:54,094 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:03:54,104 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/ps6-ll_unwindbound50.c[458,471] [2023-12-25 05:03:54,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:03:54,125 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:03:54,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54 WrapperNode [2023-12-25 05:03:54,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:03:54,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:03:54,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:03:54,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:03:54,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,154 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-12-25 05:03:54,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:03:54,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:03:54,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:03:54,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:03:54,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,175 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 05:03:54,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:03:54,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:03:54,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:03:54,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:03:54,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (1/1) ... [2023-12-25 05:03:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:03:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:03:54,209 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 05:03:54,234 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 05:03:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:03:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:03:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:03:54,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:03:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:03:54,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:03:54,301 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:03:54,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:03:54,613 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:03:54,647 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:03:54,647 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:03:54,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:03:54 BoogieIcfgContainer [2023-12-25 05:03:54,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:03:54,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:03:54,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:03:54,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:03:54,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:03:53" (1/3) ... [2023-12-25 05:03:54,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be52261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:03:54, skipping insertion in model container [2023-12-25 05:03:54,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:03:54" (2/3) ... [2023-12-25 05:03:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be52261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:03:54, skipping insertion in model container [2023-12-25 05:03:54,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:03:54" (3/3) ... [2023-12-25 05:03:54,658 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound50.c [2023-12-25 05:03:54,670 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:03:54,670 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:03:54,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:03:54,702 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;@76c7e37f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:03:54,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:03:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 05:03:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 05:03:54,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:54,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:54,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:54,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 793793432, now seen corresponding path program 1 times [2023-12-25 05:03:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437593420] [2023-12-25 05:03:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:54,724 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 05:03:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:54,726 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 05:03:54,727 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 05:03:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:54,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:03:54,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:54,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:54,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437593420] [2023-12-25 05:03:54,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437593420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:54,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:03:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528322334] [2023-12-25 05:03:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:54,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:03:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:03:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:03:54,914 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:54,948 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2023-12-25 05:03:54,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:03:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 05:03:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:54,954 INFO L225 Difference]: With dead ends: 32 [2023-12-25 05:03:54,954 INFO L226 Difference]: Without dead ends: 15 [2023-12-25 05:03:54,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 05:03:54,961 INFO L413 NwaCegarLoop]: 18 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, 18 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 05:03:54,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:03:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-25 05:03:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-25 05:03:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 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 05:03:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-25 05:03:54,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2023-12-25 05:03:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:54,985 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-25 05:03:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-25 05:03:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 05:03:54,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:54,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:54,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 05:03:55,196 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 05:03:55,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:55,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1922989550, now seen corresponding path program 1 times [2023-12-25 05:03:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:55,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110154103] [2023-12-25 05:03:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:55,198 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 05:03:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:55,199 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 05:03:55,200 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 05:03:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:55,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 05:03:55,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:55,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:55,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110154103] [2023-12-25 05:03:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110154103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:03:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377942960] [2023-12-25 05:03:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:55,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 05:03:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 05:03:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:03:55,443 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:55,472 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-25 05:03:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 05:03:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 05:03:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:55,473 INFO L225 Difference]: With dead ends: 25 [2023-12-25 05:03:55,473 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 05:03:55,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:03:55,474 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:03:55,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:03:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 05:03:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 05:03:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 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 05:03:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-25 05:03:55,478 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2023-12-25 05:03:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:55,479 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-25 05:03:55,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-25 05:03:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 05:03:55,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:55,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:55,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:03:55,688 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 05:03:55,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:55,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1924777010, now seen corresponding path program 1 times [2023-12-25 05:03:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247667917] [2023-12-25 05:03:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:55,690 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 05:03:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:55,691 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 05:03:55,693 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 05:03:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:55,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:03:55,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:55,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:03:55,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247667917] [2023-12-25 05:03:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247667917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:03:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:03:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:03:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668848813] [2023-12-25 05:03:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:03:55,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:03:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:03:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:03:55,975 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:03:57,784 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-25 05:03:57,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:03:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 05:03:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:03:57,795 INFO L225 Difference]: With dead ends: 27 [2023-12-25 05:03:57,795 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 05:03:57,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:03:57,796 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:03:57,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 05:03:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 05:03:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 05:03:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 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 05:03:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 05:03:57,801 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2023-12-25 05:03:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:03:57,801 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 05:03:57,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:03:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 05:03:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:03:57,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:03:57,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:03:57,814 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 05:03:58,002 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 05:03:58,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:03:58,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:03:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 76913492, now seen corresponding path program 1 times [2023-12-25 05:03:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:03:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043219866] [2023-12-25 05:03:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:03:58,004 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 05:03:58,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:03:58,005 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 05:03:58,012 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 05:03:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:03:58,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:03:58,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:03:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:58,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:03:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:03:58,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043219866] [2023-12-25 05:03:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043219866] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:03:58,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:03:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 05:03:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289217848] [2023-12-25 05:03:58,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:03:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 05:03:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 05:03:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 05:03:58,707 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:03:59,833 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 05:04:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:04:06,779 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-12-25 05:04:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 05:04:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 05:04:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:04:06,795 INFO L225 Difference]: With dead ends: 57 [2023-12-25 05:04:06,795 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 05:04:06,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 05:04:06,796 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-25 05:04:06,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-12-25 05:04:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 05:04:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-25 05:04:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 05:04:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-12-25 05:04:06,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 17 [2023-12-25 05:04:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:04:06,804 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-12-25 05:04:06,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 05:04:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-12-25 05:04:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:04:06,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:04:06,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:04:06,819 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 05:04:07,009 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 05:04:07,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:04:07,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:04:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash 78700952, now seen corresponding path program 1 times [2023-12-25 05:04:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:04:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886162111] [2023-12-25 05:04:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:04:07,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 05:04:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:04:07,012 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 05:04:07,015 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 05:04:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:04:07,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:04:07,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:04:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:04:07,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 05:04:30,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886162111] [2023-12-25 05:04:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886162111] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:04:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:04:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:04:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173980479] [2023-12-25 05:04:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:04:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:04:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:04:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:04:30,303 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:04:34,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:04:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:04:36,664 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-12-25 05:04:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:04:36,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-25 05:04:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:04:36,665 INFO L225 Difference]: With dead ends: 59 [2023-12-25 05:04:36,666 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 05:04:36,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:04:36,666 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:04:36,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 05:04:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 05:04:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-25 05:04:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 05:04:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-25 05:04:36,683 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 17 [2023-12-25 05:04:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:04:36,683 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-25 05:04:36,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:04:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-25 05:04:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 05:04:36,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:04:36,684 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:04:36,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 05:04:36,899 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 05:04:36,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:04:36,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:04:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash 731759343, now seen corresponding path program 1 times [2023-12-25 05:04:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:04:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906142203] [2023-12-25 05:04:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:04:36,900 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 05:04:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:04:36,901 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 05:04:36,902 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 05:04:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:04:37,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:04:37,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:04:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:04:38,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:04:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:04:52,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:04:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906142203] [2023-12-25 05:04:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906142203] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:04:52,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:04:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 05:04:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271937124] [2023-12-25 05:04:52,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:04:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 05:04:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:04:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 05:04:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 05:04:52,659 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:05:12,688 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-25 05:05:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 05:05:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-12-25 05:05:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:05:12,708 INFO L225 Difference]: With dead ends: 56 [2023-12-25 05:05:12,708 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 05:05:12,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-25 05:05:12,711 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:05:12,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-12-25 05:05:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 05:05:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-25 05:05:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-12-25 05:05:12,748 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2023-12-25 05:05:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:05:12,748 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-12-25 05:05:12,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:05:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-12-25 05:05:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 05:05:12,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:05:12,751 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:05:12,766 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 05:05:12,956 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 05:05:12,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:05:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:05:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1074423298, now seen corresponding path program 1 times [2023-12-25 05:05:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:05:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78981269] [2023-12-25 05:05:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:05:12,957 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 05:05:12,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:05:12,958 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 05:05:12,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 05:05:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:05:14,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 05:05:14,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:05:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:05:14,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:05:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 05:05:15,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:05:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78981269] [2023-12-25 05:05:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78981269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:05:15,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:05:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 05:05:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086462486] [2023-12-25 05:05:15,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:05:15,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 05:05:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:05:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 05:05:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 05:05:15,314 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 05:05:25,310 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 05:05:42,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:05:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:05:42,302 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2023-12-25 05:05:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 05:05:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 46 [2023-12-25 05:05:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:05:42,319 INFO L225 Difference]: With dead ends: 131 [2023-12-25 05:05:42,319 INFO L226 Difference]: Without dead ends: 121 [2023-12-25 05:05:42,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 05:05:42,320 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 96 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2023-12-25 05:05:42,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 231 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 25.9s Time] [2023-12-25 05:05:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-25 05:05:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2023-12-25 05:05:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 73 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 05:05:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-12-25 05:05:42,338 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 46 [2023-12-25 05:05:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:05:42,338 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-12-25 05:05:42,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 05:05:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-12-25 05:05:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 05:05:42,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:05:42,339 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:05:42,375 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 (8)] Ended with exit code 0 [2023-12-25 05:05:42,553 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 05:05:42,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:05:42,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:05:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1441866883, now seen corresponding path program 2 times [2023-12-25 05:05:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:05:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144322322] [2023-12-25 05:05:42,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:05:42,555 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 05:05:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:05:42,557 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 05:05:42,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 (9)] Waiting until timeout for monitored process [2023-12-25 05:05:43,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:05:43,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:05:43,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 05:05:43,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:05:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 05:05:45,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:06:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 05:06:26,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:06:26,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144322322] [2023-12-25 05:06:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144322322] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:06:26,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:06:26,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-25 05:06:26,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521003826] [2023-12-25 05:06:26,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:06:26,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 05:06:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:06:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 05:06:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-25 05:06:26,857 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:06:59,073 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:07:16,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:25,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:26,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:36,701 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2023-12-25 05:07:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 05:07:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 52 [2023-12-25 05:07:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:36,725 INFO L225 Difference]: With dead ends: 107 [2023-12-25 05:07:36,725 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 05:07:36,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-12-25 05:07:36,727 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:36,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 339 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2023-12-25 05:07:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 05:07:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-12-25 05:07:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:07:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2023-12-25 05:07:36,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 52 [2023-12-25 05:07:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:36,746 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2023-12-25 05:07:36,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 05:07:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2023-12-25 05:07:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-25 05:07:36,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:36,748 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:36,787 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 05:07:36,952 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 05:07:36,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:36,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:36,953 INFO L85 PathProgramCache]: Analyzing trace with hash 531722778, now seen corresponding path program 2 times [2023-12-25 05:07:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878270491] [2023-12-25 05:07:36,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:07:36,954 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 05:07:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:36,955 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 05:07:36,956 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 05:07:39,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:07:39,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:07:40,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 05:07:40,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:07:41,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:07:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 05:07:44,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878270491] [2023-12-25 05:07:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878270491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:07:44,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:07:44,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-25 05:07:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959405056] [2023-12-25 05:07:44,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:07:44,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 05:07:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 05:07:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-12-25 05:07:44,130 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-25 05:07:56,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:01,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:04,732 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 05:08:08,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:19,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:25,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:34,797 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 05:08:39,129 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 05:08:53,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:09:00,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:09:02,298 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 05:09:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:09:02,462 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions. [2023-12-25 05:09:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-25 05:09:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 94 [2023-12-25 05:09:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:09:02,482 INFO L225 Difference]: With dead ends: 263 [2023-12-25 05:09:02,482 INFO L226 Difference]: Without dead ends: 253 [2023-12-25 05:09:02,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=971, Invalid=2221, Unknown=0, NotChecked=0, Total=3192 [2023-12-25 05:09:02,484 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 402 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:09:02,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 683 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 73.5s Time] [2023-12-25 05:09:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-25 05:09:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2023-12-25 05:09:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 151 states have internal predecessors, (153), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 23 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 05:09:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2023-12-25 05:09:02,541 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 94 [2023-12-25 05:09:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:09:02,541 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2023-12-25 05:09:02,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 21 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-25 05:09:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2023-12-25 05:09:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 05:09:02,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:09:02,542 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:09:02,617 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 05:09:02,744 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 05:09:02,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:09:02,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:09:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 481767065, now seen corresponding path program 3 times [2023-12-25 05:09:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:09:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161365237] [2023-12-25 05:09:02,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:09:02,745 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 05:09:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:09:02,746 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 05:09:02,748 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 05:09:13,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 05:09:13,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:09:13,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 05:09:13,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:09:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 05:09:17,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:10:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 05:10:49,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:49,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161365237] [2023-12-25 05:10:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161365237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:10:49,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:10:49,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-25 05:10:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852406457] [2023-12-25 05:10:49,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:10:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 05:10:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 05:10:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2023-12-25 05:10:49,064 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:11:33,795 WARN L293 SmtUtils]: Spent 17.45s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:11:52,710 WARN L293 SmtUtils]: Spent 9.82s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:12:16,483 WARN L293 SmtUtils]: Spent 17.27s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:12:18,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:12:36,623 WARN L293 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:12:53,560 WARN L293 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:13:07,471 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:13:18,889 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:13:51,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:59,447 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 05:14:29,197 WARN L293 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:14:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:14:30,207 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2023-12-25 05:14:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 05:14:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 100 [2023-12-25 05:14:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:14:30,241 INFO L225 Difference]: With dead ends: 209 [2023-12-25 05:14:30,241 INFO L226 Difference]: Without dead ends: 191 [2023-12-25 05:14:30,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 233.6s TimeCoverageRelationStatistics Valid=689, Invalid=2391, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 05:14:30,242 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 111 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:14:30,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 697 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 42.6s Time] [2023-12-25 05:14:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-25 05:14:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2023-12-25 05:14:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 141 states have (on average 1.0141843971631206) internal successors, (143), 141 states have internal predecessors, (143), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:14:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2023-12-25 05:14:30,300 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 100 [2023-12-25 05:14:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:14:30,300 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2023-12-25 05:14:30,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-25 05:14:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2023-12-25 05:14:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-25 05:14:30,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:14:30,302 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:14:30,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 05:14:30,505 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 05:14:30,506 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:14:30,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:14:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 839887442, now seen corresponding path program 3 times [2023-12-25 05:14:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:14:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886846359] [2023-12-25 05:14:30,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:14:30,507 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 05:14:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:14:30,508 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 05:14:30,508 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 05:14:52,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2023-12-25 05:14:52,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:14:53,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-25 05:14:53,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:14:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:14:58,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:15:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 46 proven. 968 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-25 05:15:08,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:15:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886846359] [2023-12-25 05:15:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886846359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:15:08,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:15:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2023-12-25 05:15:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763603005] [2023-12-25 05:15:08,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:15:08,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-25 05:15:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:15:08,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-25 05:15:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=1971, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 05:15:08,041 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand has 52 states, 52 states have (on average 4.153846153846154) internal successors, (216), 52 states have internal predecessors, (216), 45 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2023-12-25 05:15:11,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:25,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:30,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:39,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:49,336 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 05:15:52,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:57,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:59,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:02,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:18,236 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 05:16:34,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:38,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:04,432 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 05:17:07,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:17,378 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 05:17:24,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:43,546 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 05:17:51,457 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 05:17:52,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:56,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:07,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:12,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:17,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 05:18:36,343 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:18:36,343 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 05:18:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-25 05:18:36,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=4190, Invalid=9616, Unknown=0, NotChecked=0, Total=13806 [2023-12-25 05:18:36,789 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 1528 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 1006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 183.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:18:36,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 2503 Invalid, 3334 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1006 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 183.5s Time] [2023-12-25 05:18:36,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:18:36,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 05:18:36,991 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 05:18:36,993 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (189states) and FLOYD_HOARE automaton (currently 94 states, 52 states before enhancement),while ReachableStatesComputation was computing reachable states (467 states constructed, input type IntersectNwa). [2023-12-25 05:18:36,996 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2023-12-25 05:18:36,998 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:18:36,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:18:36 BoogieIcfgContainer [2023-12-25 05:18:36,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:18:36,999 INFO L158 Benchmark]: Toolchain (without parser) took 883087.09ms. Allocated memory is still 264.2MB. Free memory was 228.0MB in the beginning and 208.4MB in the end (delta: 19.6MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 147.0MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.73ms. Allocated memory is still 264.2MB. Free memory was 228.0MB in the beginning and 215.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.16ms. Allocated memory is still 264.2MB. Free memory was 215.9MB in the beginning and 214.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: Boogie Preprocessor took 29.60ms. Allocated memory is still 264.2MB. Free memory was 214.3MB in the beginning and 212.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: RCFGBuilder took 462.35ms. Allocated memory is still 264.2MB. Free memory was 212.8MB in the beginning and 199.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,000 INFO L158 Benchmark]: TraceAbstraction took 882350.41ms. Allocated memory is still 264.2MB. Free memory was 198.6MB in the beginning and 208.4MB in the end (delta: -9.8MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. [2023-12-25 05:18:37,001 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.42ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 147.0MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.73ms. Allocated memory is still 264.2MB. Free memory was 228.0MB in the beginning and 215.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.16ms. Allocated memory is still 264.2MB. Free memory was 215.9MB in the beginning and 214.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.60ms. Allocated memory is still 264.2MB. Free memory was 214.3MB in the beginning and 212.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.35ms. Allocated memory is still 264.2MB. Free memory was 212.8MB in the beginning and 199.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 882350.41ms. Allocated memory is still 264.2MB. Free memory was 198.6MB in the beginning and 208.4MB in the end (delta: -9.8MB). Peak memory consumption was 122.3MB. 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: 12]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12). Cancelled while NwaCegarLoop was constructing difference of abstraction (189states) and FLOYD_HOARE automaton (currently 94 states, 52 states before enhancement),while ReachableStatesComputation was computing reachable states (467 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.3s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 641.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2246 SdHoareTripleChecker+Valid, 373.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2237 mSDsluCounter, 4820 SdHoareTripleChecker+Invalid, 345.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4401 mSDsCounter, 1488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3900 IncrementalHoareTripleChecker+Invalid, 5388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1488 mSolverCounterUnsat, 419 mSDtfsCounter, 3900 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1289 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4098 ImplicationChecksByTransitivity, 380.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=9, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 96 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 39.2s SatisfiabilityAnalysisTime, 198.6s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 6755 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1114 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 2339/6402 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