/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/egcd-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:33:35,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:33:35,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:33:35,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:33:35,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:33:35,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:33:35,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:33:35,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:33:35,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:33:35,218 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:33:35,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:33:35,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:33:35,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:33:35,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:33:35,220 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:33:35,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:33:35,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:33:35,220 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:33:35,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:33:35,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:33:35,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:33:35,222 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:33:35,223 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:33:35,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:33:35,223 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:33:35,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:33:35,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:33:35,224 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:33:35,225 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:33:35,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:33:35,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:33:35,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:33:35,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:33:35,428 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:33:35,428 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:33:35,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound100.c [2023-12-25 01:33:36,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:33:37,034 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:33:37,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound100.c [2023-12-25 01:33:37,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394acce32/c31e963a15f94dd6835eb9d995497715/FLAGd92f509df [2023-12-25 01:33:37,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394acce32/c31e963a15f94dd6835eb9d995497715 [2023-12-25 01:33:37,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:33:37,062 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:33:37,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:33:37,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:33:37,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:33:37,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493011e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37, skipping insertion in model container [2023-12-25 01:33:37,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:33:37,191 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/egcd-ll_valuebound100.c[489,502] [2023-12-25 01:33:37,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:33:37,214 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:33:37,222 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/egcd-ll_valuebound100.c[489,502] [2023-12-25 01:33:37,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:33:37,255 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:33:37,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37 WrapperNode [2023-12-25 01:33:37,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:33:37,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:33:37,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:33:37,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:33:37,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,286 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 01:33:37,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:33:37,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:33:37,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:33:37,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:33:37,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:33:37,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:33:37,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:33:37,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:33:37,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:33:37,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (1/1) ... [2023-12-25 01:33:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:33:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:33:37,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:33:37,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:33:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:33:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:33:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:33:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:33:37,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:33:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:33:37,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:33:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:33:37,471 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:33:37,473 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:33:37,654 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:33:37,689 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:33:37,689 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 01:33:37,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:33:37 BoogieIcfgContainer [2023-12-25 01:33:37,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:33:37,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:33:37,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:33:37,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:33:37,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:33:37" (1/3) ... [2023-12-25 01:33:37,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1189cc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:33:37, skipping insertion in model container [2023-12-25 01:33:37,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:33:37" (2/3) ... [2023-12-25 01:33:37,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1189cc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:33:37, skipping insertion in model container [2023-12-25 01:33:37,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:33:37" (3/3) ... [2023-12-25 01:33:37,695 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound100.c [2023-12-25 01:33:37,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:33:37,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:33:37,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:33:37,751 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;@5d4e10d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:33:37,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:33:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:33:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:33:37,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:33:37,765 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:37,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:33:37,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:33:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1514925992, now seen corresponding path program 1 times [2023-12-25 01:33:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:33:37,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631523396] [2023-12-25 01:33:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:33:37,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:37,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:33:37,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:33:37,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:33:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:33:37,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 01:33:37,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:33:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:33:38,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:33:38,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:33:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631523396] [2023-12-25 01:33:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631523396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:33:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:33:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:33:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916260463] [2023-12-25 01:33:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:33:38,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:33:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:33:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:33:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:33:38,052 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:33:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:33:38,849 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2023-12-25 01:33:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:33:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 01:33:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:33:38,869 INFO L225 Difference]: With dead ends: 71 [2023-12-25 01:33:38,869 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 01:33:38,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:33:38,873 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:33:38,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 01:33:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 01:33:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-25 01:33:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 01:33:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2023-12-25 01:33:38,914 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 28 [2023-12-25 01:33:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:33:38,916 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2023-12-25 01:33:38,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:33:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2023-12-25 01:33:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 01:33:38,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:33:38,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:38,948 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 01:33:39,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:39,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:33:39,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:33:39,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1720779372, now seen corresponding path program 1 times [2023-12-25 01:33:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:33:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857929090] [2023-12-25 01:33:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:33:39,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:33:39,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:33:39,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:33:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:33:39,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:33:39,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:33:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:33:39,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:33:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:33:43,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:33:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857929090] [2023-12-25 01:33:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857929090] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:33:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:33:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 01:33:43,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593712139] [2023-12-25 01:33:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:33:43,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:33:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:33:43,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:33:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:33:43,275 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:33:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:33:48,144 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2023-12-25 01:33:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:33:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-25 01:33:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:33:48,159 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:33:48,159 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 01:33:48,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:33:48,160 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:33:48,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-25 01:33:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 01:33:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2023-12-25 01:33:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 01:33:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2023-12-25 01:33:48,172 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 33 [2023-12-25 01:33:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:33:48,172 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2023-12-25 01:33:48,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:33:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2023-12-25 01:33:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:33:48,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:33:48,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:48,179 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 01:33:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:48,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:33:48,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:33:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1127883240, now seen corresponding path program 1 times [2023-12-25 01:33:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:33:48,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200296994] [2023-12-25 01:33:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:33:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:33:48,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:33:48,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:33:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:33:48,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:33:48,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:33:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:33:49,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:33:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 01:33:53,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:33:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200296994] [2023-12-25 01:33:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200296994] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:33:53,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:33:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 01:33:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241875770] [2023-12-25 01:33:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:33:53,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:33:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:33:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:33:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:33:53,400 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:33:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:33:59,955 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2023-12-25 01:33:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:33:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-25 01:33:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:33:59,971 INFO L225 Difference]: With dead ends: 63 [2023-12-25 01:33:59,971 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 01:33:59,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:33:59,972 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:33:59,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-25 01:33:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 01:33:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-25 01:33:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 01:33:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2023-12-25 01:33:59,984 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 38 [2023-12-25 01:33:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:33:59,984 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-12-25 01:33:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:33:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2023-12-25 01:33:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 01:33:59,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:33:59,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:59,994 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 (4)] Ended with exit code 0 [2023-12-25 01:34:00,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:00,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:34:00,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:34:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1622474211, now seen corresponding path program 1 times [2023-12-25 01:34:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:34:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271030661] [2023-12-25 01:34:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:34:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:34:00,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:34:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:34:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:34:00,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 01:34:00,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:34:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:34:00,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:34:00,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:34:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271030661] [2023-12-25 01:34:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271030661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:34:00,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:34:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:34:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676401541] [2023-12-25 01:34:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:34:00,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:34:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:34:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:34:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:34:00,485 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-25 01:34:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:34:01,874 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2023-12-25 01:34:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:34:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 44 [2023-12-25 01:34:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:34:01,889 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:34:01,889 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 01:34:01,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:34:01,890 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:34:01,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 01:34:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 01:34:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-25 01:34:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 01:34:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-12-25 01:34:01,900 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 44 [2023-12-25 01:34:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:34:01,900 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-12-25 01:34:01,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-25 01:34:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-12-25 01:34:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 01:34:01,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:34:01,901 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:34:01,921 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 (5)] Ended with exit code 0 [2023-12-25 01:34:02,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:02,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:34:02,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:34:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 302551960, now seen corresponding path program 1 times [2023-12-25 01:34:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:34:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104920825] [2023-12-25 01:34:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:34:02,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:34:02,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:34:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:34:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:34:02,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:34:02,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:34:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 01:34:02,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:34:02,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:34:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104920825] [2023-12-25 01:34:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104920825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:34:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:34:02,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:34:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387165596] [2023-12-25 01:34:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:34:02,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:34:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:34:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:34:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:34:02,555 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:34:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:34:03,666 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2023-12-25 01:34:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:34:03,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-12-25 01:34:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:34:03,685 INFO L225 Difference]: With dead ends: 79 [2023-12-25 01:34:03,686 INFO L226 Difference]: Without dead ends: 77 [2023-12-25 01:34:03,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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 01:34:03,686 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:34:03,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 01:34:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-25 01:34:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-12-25 01:34:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.225) internal successors, (49), 43 states have internal predecessors, (49), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 01:34:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2023-12-25 01:34:03,697 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 46 [2023-12-25 01:34:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:34:03,697 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2023-12-25 01:34:03,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:34:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2023-12-25 01:34:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 01:34:03,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:34:03,698 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:34:03,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:34:03,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 01:34:03,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:34:03,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:34:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -399804329, now seen corresponding path program 1 times [2023-12-25 01:34:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:34:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917130553] [2023-12-25 01:34:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:34:03,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 01:34:03,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:34:03,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 01:34:03,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:34:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:34:04,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:34:04,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:34:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:34:04,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:34:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 01:34:16,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:34:16,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917130553] [2023-12-25 01:34:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917130553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:34:16,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:34:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2023-12-25 01:34:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108561447] [2023-12-25 01:34:16,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:34:16,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 01:34:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:34:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 01:34:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:34:16,473 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-25 01:34:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:34:25,401 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2023-12-25 01:34:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:34:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) Word has length 49 [2023-12-25 01:34:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:34:25,426 INFO L225 Difference]: With dead ends: 93 [2023-12-25 01:34:25,426 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 01:34:25,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:34:25,427 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:34:25,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 125 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-25 01:34:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 01:34:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-12-25 01:34:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 01:34:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2023-12-25 01:34:25,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 49 [2023-12-25 01:34:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:34:25,446 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2023-12-25 01:34:25,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-25 01:34:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2023-12-25 01:34:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 01:34:25,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:34:25,448 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:34:25,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:34:25,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:25,660 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:34:25,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:34:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1174147334, now seen corresponding path program 1 times [2023-12-25 01:34:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:34:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752587285] [2023-12-25 01:34:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:34:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:34:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:34:25,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:34:25,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:34:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:34:26,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 01:34:26,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:34:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:34:27,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:34:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:34:54,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:34:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752587285] [2023-12-25 01:34:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752587285] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:34:54,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:34:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2023-12-25 01:34:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477146479] [2023-12-25 01:34:54,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:34:54,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 01:34:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:34:54,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 01:34:54,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:34:54,449 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 01:34:55,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 01:35:19,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:35:26,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:35:31,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:35:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:35:47,614 INFO L93 Difference]: Finished difference Result 128 states and 173 transitions. [2023-12-25 01:35:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 01:35:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 51 [2023-12-25 01:35:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:35:47,642 INFO L225 Difference]: With dead ends: 128 [2023-12-25 01:35:47,642 INFO L226 Difference]: Without dead ends: 126 [2023-12-25 01:35:47,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=108, Invalid=396, Unknown=2, NotChecked=0, Total=506 [2023-12-25 01:35:47,643 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:35:47,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 289 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 256 Invalid, 3 Unknown, 0 Unchecked, 29.1s Time] [2023-12-25 01:35:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-25 01:35:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2023-12-25 01:35:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 01:35:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2023-12-25 01:35:47,671 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 51 [2023-12-25 01:35:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:35:47,671 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2023-12-25 01:35:47,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 01:35:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2023-12-25 01:35:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 01:35:47,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:35:47,676 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:35:47,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:35:47,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:35:47,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:35:47,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:35:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1272014376, now seen corresponding path program 2 times [2023-12-25 01:35:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:35:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585369387] [2023-12-25 01:35:47,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:35:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:35:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:35:47,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:35:47,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:35:48,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:35:48,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:35:48,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 01:35:48,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:35:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-25 01:35:49,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:36:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:36:31,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:36:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585369387] [2023-12-25 01:36:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585369387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:36:31,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:36:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2023-12-25 01:36:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169896356] [2023-12-25 01:36:31,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:36:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 01:36:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:36:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 01:36:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:36:31,960 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:36:54,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:04,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:07,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:15,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:19,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:23,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:27,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:29,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:31,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:34,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:36,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:38,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:40,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:55,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:37:58,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:38:00,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:38:03,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:38:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:38:13,916 INFO L93 Difference]: Finished difference Result 163 states and 233 transitions. [2023-12-25 01:38:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 01:38:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 56 [2023-12-25 01:38:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:38:13,947 INFO L225 Difference]: With dead ends: 163 [2023-12-25 01:38:13,947 INFO L226 Difference]: Without dead ends: 152 [2023-12-25 01:38:13,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=129, Invalid=470, Unknown=1, NotChecked=0, Total=600 [2023-12-25 01:38:13,948 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 45 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:38:13,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 289 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 69.6s Time] [2023-12-25 01:38:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-25 01:38:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2023-12-25 01:38:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 79 states have internal predecessors, (93), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 01:38:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 185 transitions. [2023-12-25 01:38:13,982 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 185 transitions. Word has length 56 [2023-12-25 01:38:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:38:13,983 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 185 transitions. [2023-12-25 01:38:13,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:38:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 185 transitions. [2023-12-25 01:38:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 01:38:13,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:38:13,984 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:38:13,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:38:14,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:38:14,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:38:14,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:38:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash 649788874, now seen corresponding path program 1 times [2023-12-25 01:38:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:38:14,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246967247] [2023-12-25 01:38:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:38:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:38:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:38:14,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:38:14,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:38:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:38:14,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:38:14,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:38:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 01:38:15,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:38:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-25 01:38:35,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:38:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246967247] [2023-12-25 01:38:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246967247] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:38:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:38:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-12-25 01:38:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602294964] [2023-12-25 01:38:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:38:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:38:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:38:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:38:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:38:35,975 INFO L87 Difference]: Start difference. First operand 137 states and 185 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:38:39,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:38:40,461 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 01:38:43,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:38:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:38:44,711 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2023-12-25 01:38:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:38:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2023-12-25 01:38:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:38:44,763 INFO L225 Difference]: With dead ends: 143 [2023-12-25 01:38:44,763 INFO L226 Difference]: Without dead ends: 138 [2023-12-25 01:38:44,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:38:44,764 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:38:44,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-12-25 01:38:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-25 01:38:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-12-25 01:38:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 01:38:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-12-25 01:38:44,796 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 64 [2023-12-25 01:38:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:38:44,796 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-12-25 01:38:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:38:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-12-25 01:38:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-25 01:38:44,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:38:44,797 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:38:44,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:38:45,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:38:45,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:38:45,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:38:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1675996778, now seen corresponding path program 2 times [2023-12-25 01:38:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:38:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988207228] [2023-12-25 01:38:45,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:38:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:38:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:38:45,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:38:45,052 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 01:38:46,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:38:46,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:38:46,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-25 01:38:46,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:38:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 51 proven. 53 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-25 01:38:52,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:40:38,798 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:40:44,144 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:40:52,327 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:41:05,602 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (bvmul |c_ULTIMATE.start_main_~r~0#1| .cse7)) (.cse5 (bvmul .cse6 |c_ULTIMATE.start_main_~p~0#1|)) (.cse2 (bvmul .cse7 (bvneg |c_ULTIMATE.start_main_~s~0#1|))) (.cse3 (bvmul .cse6 (bvneg |c_ULTIMATE.start_main_~q~0#1|)))) (let ((.cse0 (bvneg |c_ULTIMATE.start_main_~b~0#1|)) (.cse1 (bvadd .cse4 .cse5 .cse2 .cse3))) (or (not (= (bvadd |c_ULTIMATE.start_main_~a~0#1| .cse0) .cse1)) (not (bvsgt |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (= (bvadd .cse2 .cse3) .cse0) (not (= (bvadd .cse4 .cse5) |c_ULTIMATE.start_main_~a~0#1|)) (not (bvsgt .cse1 |c_ULTIMATE.start_main_~b~0#1|)))))) is different from true [2023-12-25 01:41:14,469 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:41:26,926 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:41:43,844 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:41:56,223 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:42:12,959 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:42:21,127 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:42:29,293 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:42:47,543 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvneg |c_ULTIMATE.start_main_~q~0#1|)) (.cse7 (bvneg |c_ULTIMATE.start_main_~s~0#1|)) (.cse9 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|)) (.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse5 (bvneg |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| .cse5)) (.cse1 (bvmul |c_ULTIMATE.start_main_~r~0#1| .cse6)) (.cse2 (bvmul .cse9 |c_ULTIMATE.start_main_~p~0#1|)) (.cse3 (bvmul .cse6 .cse7)) (.cse4 (bvmul .cse9 .cse8))) (or (not (bvsgt .cse0 |c_ULTIMATE.start_main_~b~0#1|)) (not (= .cse0 (bvadd .cse1 .cse2 .cse3 .cse4))) (not (= (bvadd (bvmul (_ bv2 64) .cse5) |c_ULTIMATE.start_main_~a~0#1|) (bvadd (bvmul (_ bv2 64) .cse3) .cse1 .cse2 (bvmul (_ bv2 64) .cse4)))) (not (bvsgt |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (= (bvadd .cse3 .cse4) .cse5) (not (bvsgt (bvadd .cse3 (bvmul .cse6 (bvadd |c_ULTIMATE.start_main_~r~0#1| .cse7)) .cse4 (bvmul (bvadd .cse8 |c_ULTIMATE.start_main_~p~0#1|) .cse9)) |c_ULTIMATE.start_main_~b~0#1|))))) is different from true [2023-12-25 01:42:55,729 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:43:03,903 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:43:12,068 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:43:38,369 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:43:46,517 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:43:54,654 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:04,408 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:09,412 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:17,568 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:25,708 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:33,863 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:39,114 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:44:56,520 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:04,661 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:12,828 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:18,375 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:35,575 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:43,714 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:45:51,853 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:46:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 26 refuted. 0 times theorem prover too weak. 156 trivial. 21 not checked. [2023-12-25 01:46:05,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988207228] [2023-12-25 01:46:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988207228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:46:05,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:46:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2023-12-25 01:46:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3663003] [2023-12-25 01:46:05,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:46:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 01:46:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 01:46:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=413, Unknown=4, NotChecked=86, Total=600 [2023-12-25 01:46:05,946 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 13 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2023-12-25 01:46:08,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 01:46:10,426 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 01:47:01,939 WARN L293 SmtUtils]: Spent 23.26s on a formula simplification. DAG size of input: 39 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:47:09,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:16,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:17,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:22,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:26,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:38,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:16,257 WARN L293 SmtUtils]: Spent 28.18s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:48:20,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 01:48:22,977 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:48:22,989 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 01:48:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 01:48:23,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 170.9s TimeCoverageRelationStatistics Valid=157, Invalid=657, Unknown=6, NotChecked=110, Total=930 [2023-12-25 01:48:23,126 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:48:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 193 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 306 Invalid, 4 Unknown, 121 Unchecked, 44.5s Time] [2023-12-25 01:48:23,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:48:23,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 01:48:23,328 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 01:48:23,328 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (138states) and FLOYD_HOARE automaton (currently 19 states, 25 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. [2023-12-25 01:48:23,331 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:48:23,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:48:23,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:48:23 BoogieIcfgContainer [2023-12-25 01:48:23,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:48:23,335 INFO L158 Benchmark]: Toolchain (without parser) took 886272.92ms. Allocated memory is still 226.5MB. Free memory was 184.0MB in the beginning and 150.3MB in the end (delta: 33.7MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,335 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 188.7MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:48:23,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.07ms. Allocated memory is still 226.5MB. Free memory was 184.0MB in the beginning and 172.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.25ms. Allocated memory is still 226.5MB. Free memory was 172.2MB in the beginning and 170.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,335 INFO L158 Benchmark]: Boogie Preprocessor took 60.02ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 168.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,335 INFO L158 Benchmark]: RCFGBuilder took 341.51ms. Allocated memory is still 226.5MB. Free memory was 168.7MB in the beginning and 155.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,336 INFO L158 Benchmark]: TraceAbstraction took 885643.33ms. Allocated memory is still 226.5MB. Free memory was 154.7MB in the beginning and 150.3MB in the end (delta: 4.4MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2023-12-25 01:48:23,339 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.35ms. Allocated memory is still 188.7MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.07ms. Allocated memory is still 226.5MB. Free memory was 184.0MB in the beginning and 172.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.25ms. Allocated memory is still 226.5MB. Free memory was 172.2MB in the beginning and 170.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.02ms. Allocated memory is still 226.5MB. Free memory was 170.5MB in the beginning and 168.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.51ms. Allocated memory is still 226.5MB. Free memory was 168.7MB in the beginning and 155.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885643.33ms. Allocated memory is still 226.5MB. Free memory was 154.7MB in the beginning and 150.3MB in the end (delta: 4.4MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was constructing difference of abstraction (138states) and FLOYD_HOARE automaton (currently 19 states, 25 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.6s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 325.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 170.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 1582 SdHoareTripleChecker+Invalid, 162.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 121 IncrementalHoareTripleChecker+Unchecked, 1279 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 303 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 749 SyntacticMatches, 8 SemanticMatches, 137 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 296.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=9, InterpolantAutomatonStates: 85, 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, 9 MinimizatonAttempts, 43 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 554.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 5377 SizeOfPredicates, 40 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 1149/1326 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