/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/hard-u_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:27:36,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:27:36,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:27:36,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:27:36,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:27:36,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:27:36,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:27:36,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:27:36,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:27:36,448 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:27:36,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:27:36,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:27:36,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:27:36,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:27:36,450 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:27:36,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:27:36,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:27:36,450 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:27:36,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:27:36,452 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:27:36,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:27:36,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:27:36,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:27:36,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:27:36,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:27:36,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:27:36,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:27:36,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:27:36,455 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:27:36,455 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:27:36,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:27:36,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:27:36,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:27:36,646 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:27:36,646 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:27:36,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c [2023-12-25 03:27:37,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:27:37,752 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:27:37,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound10.c [2023-12-25 03:27:37,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c291d9b66/34d43e4b5f524335b6210677e418140b/FLAG6b94a47a5 [2023-12-25 03:27:37,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c291d9b66/34d43e4b5f524335b6210677e418140b [2023-12-25 03:27:37,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:27:37,768 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:27:37,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:27:37,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:27:37,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:27:37,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfab381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37, skipping insertion in model container [2023-12-25 03:27:37,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,789 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:27:37,877 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/hard-u_unwindbound10.c[537,550] [2023-12-25 03:27:37,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:27:37,896 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:27:37,904 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/hard-u_unwindbound10.c[537,550] [2023-12-25 03:27:37,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:27:37,917 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:27:37,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37 WrapperNode [2023-12-25 03:27:37,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:27:37,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:27:37,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:27:37,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:27:37,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,939 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-25 03:27:37,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:27:37,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:27:37,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:27:37,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:27:37,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,961 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 03:27:37,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:27:37,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:27:37,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:27:37,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:27:37,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (1/1) ... [2023-12-25 03:27:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:27:37,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:27:38,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:27:38,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:27:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:27:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:27:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:27:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:27:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:27:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:27:38,098 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:27:38,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:27:38,260 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:27:38,288 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:27:38,288 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:27:38,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:27:38 BoogieIcfgContainer [2023-12-25 03:27:38,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:27:38,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:27:38,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:27:38,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:27:38,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:27:37" (1/3) ... [2023-12-25 03:27:38,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403db0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:27:38, skipping insertion in model container [2023-12-25 03:27:38,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:27:37" (2/3) ... [2023-12-25 03:27:38,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403db0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:27:38, skipping insertion in model container [2023-12-25 03:27:38,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:27:38" (3/3) ... [2023-12-25 03:27:38,301 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound10.c [2023-12-25 03:27:38,312 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:27:38,313 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:27:38,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:27:38,345 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;@3075e772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:27:38,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:27:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 03:27:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 03:27:38,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:38,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:38,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:38,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 65649153, now seen corresponding path program 1 times [2023-12-25 03:27:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312479660] [2023-12-25 03:27:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:38,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:38,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:38,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:27:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:38,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:27:38,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:27:38,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:38,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312479660] [2023-12-25 03:27:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312479660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:38,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:27:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040173592] [2023-12-25 03:27:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:38,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:27:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:27:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:27:38,466 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:38,484 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2023-12-25 03:27:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:27:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 03:27:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:38,491 INFO L225 Difference]: With dead ends: 48 [2023-12-25 03:27:38,491 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 03:27:38,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:27:38,496 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:38,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:27:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 03:27:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 03:27:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:27:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-12-25 03:27:38,531 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-12-25 03:27:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:38,531 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-12-25 03:27:38,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-12-25 03:27:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 03:27:38,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:38,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:38,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 03:27:38,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:38,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:38,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1205755883, now seen corresponding path program 1 times [2023-12-25 03:27:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151423698] [2023-12-25 03:27:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:38,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:38,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:38,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:27:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:38,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:27:38,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:27:38,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:38,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151423698] [2023-12-25 03:27:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151423698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:38,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:27:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058814221] [2023-12-25 03:27:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:38,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:27:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:27:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:38,816 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:38,925 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2023-12-25 03:27:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:27:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 03:27:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:38,928 INFO L225 Difference]: With dead ends: 37 [2023-12-25 03:27:38,928 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 03:27:38,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:27:38,929 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:38,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:27:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 03:27:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-12-25 03:27:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:27:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-25 03:27:38,935 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-12-25 03:27:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:38,935 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-25 03:27:38,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-25 03:27:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-25 03:27:38,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:38,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:38,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:39,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:39,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2004332404, now seen corresponding path program 1 times [2023-12-25 03:27:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892406618] [2023-12-25 03:27:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:39,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:39,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 03:27:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:39,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 03:27:39,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:27:39,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:39,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892406618] [2023-12-25 03:27:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892406618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:39,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:39,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:27:39,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580353985] [2023-12-25 03:27:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:39,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 03:27:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 03:27:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 03:27:39,191 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:39,205 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2023-12-25 03:27:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 03:27:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-25 03:27:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:39,206 INFO L225 Difference]: With dead ends: 43 [2023-12-25 03:27:39,206 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 03:27:39,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 03:27:39,207 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:39,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:27:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 03:27:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 03:27:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:27:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-25 03:27:39,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2023-12-25 03:27:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:39,212 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-25 03:27:39,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:27:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-25 03:27:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 03:27:39,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:39,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:39,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:39,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:39,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1962237034, now seen corresponding path program 1 times [2023-12-25 03:27:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034825944] [2023-12-25 03:27:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:39,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:27:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:39,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:27:39,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:27:39,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:39,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:39,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034825944] [2023-12-25 03:27:39,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034825944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:39,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:39,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:27:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835926948] [2023-12-25 03:27:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:39,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:27:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:39,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:27:39,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:39,493 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:27:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:39,597 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-12-25 03:27:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:27:39,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-25 03:27:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:39,598 INFO L225 Difference]: With dead ends: 43 [2023-12-25 03:27:39,598 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 03:27:39,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:27:39,599 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:39,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:27:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 03:27:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2023-12-25 03:27:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:27:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-12-25 03:27:39,604 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2023-12-25 03:27:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:39,605 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-12-25 03:27:39,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:27:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-12-25 03:27:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-25 03:27:39,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:39,605 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:39,612 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 03:27:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:39,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash 608183541, now seen corresponding path program 1 times [2023-12-25 03:27:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012352265] [2023-12-25 03:27:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:39,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:39,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:27:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:39,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:27:39,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 03:27:39,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:39,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012352265] [2023-12-25 03:27:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012352265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:27:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620910835] [2023-12-25 03:27:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:27:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:27:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:39,906 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:27:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:40,021 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2023-12-25 03:27:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:27:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-25 03:27:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:40,022 INFO L225 Difference]: With dead ends: 62 [2023-12-25 03:27:40,023 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 03:27:40,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:27:40,023 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:40,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:27:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 03:27:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-25 03:27:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:27:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-25 03:27:40,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 19 [2023-12-25 03:27:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:40,031 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-25 03:27:40,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:27:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-25 03:27:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 03:27:40,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:40,032 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:40,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:40,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:40,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash 560729168, now seen corresponding path program 1 times [2023-12-25 03:27:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691312335] [2023-12-25 03:27:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:40,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:40,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:40,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:27:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:40,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:27:40,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:27:40,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:40,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:40,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691312335] [2023-12-25 03:27:40,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691312335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:40,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 03:27:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202669502] [2023-12-25 03:27:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:27:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:27:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:40,342 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:27:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:40,406 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-12-25 03:27:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:27:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-12-25 03:27:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:40,407 INFO L225 Difference]: With dead ends: 67 [2023-12-25 03:27:40,407 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 03:27:40,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:40,407 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:40,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:27:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 03:27:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-12-25 03:27:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:27:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-12-25 03:27:40,415 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 27 [2023-12-25 03:27:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:40,415 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-12-25 03:27:40,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:27:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-12-25 03:27:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 03:27:40,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:40,416 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:40,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:40,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:40,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:40,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 562457046, now seen corresponding path program 1 times [2023-12-25 03:27:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266298402] [2023-12-25 03:27:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:40,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:40,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:40,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 03:27:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:40,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:27:40,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:27:40,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:27:40,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:40,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266298402] [2023-12-25 03:27:40,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266298402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:27:40,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:27:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:27:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640554996] [2023-12-25 03:27:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:40,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:27:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:27:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:27:40,744 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:27:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:40,875 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-12-25 03:27:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:27:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-12-25 03:27:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:40,877 INFO L225 Difference]: With dead ends: 73 [2023-12-25 03:27:40,877 INFO L226 Difference]: Without dead ends: 61 [2023-12-25 03:27:40,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:27:40,878 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:40,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:27:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-25 03:27:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-12-25 03:27:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 03:27:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-12-25 03:27:40,885 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 27 [2023-12-25 03:27:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:40,886 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-12-25 03:27:40,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:27:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-12-25 03:27:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 03:27:40,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:40,886 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:40,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 03:27:41,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:41,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:41,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 976926058, now seen corresponding path program 1 times [2023-12-25 03:27:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876268772] [2023-12-25 03:27:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:41,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:41,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 03:27:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:41,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:27:41,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 03:27:41,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:27:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:27:41,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876268772] [2023-12-25 03:27:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876268772] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:27:41,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:27:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 03:27:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587072233] [2023-12-25 03:27:41,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:27:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:27:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:27:41,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:27:41,248 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:27:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:41,527 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2023-12-25 03:27:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 03:27:41,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 34 [2023-12-25 03:27:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:41,529 INFO L225 Difference]: With dead ends: 141 [2023-12-25 03:27:41,529 INFO L226 Difference]: Without dead ends: 116 [2023-12-25 03:27:41,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:27:41,530 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:41,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:27:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-25 03:27:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2023-12-25 03:27:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-25 03:27:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2023-12-25 03:27:41,542 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 34 [2023-12-25 03:27:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:41,542 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2023-12-25 03:27:41,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:27:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2023-12-25 03:27:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 03:27:41,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:41,543 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:41,552 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 (9)] Ended with exit code 0 [2023-12-25 03:27:41,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:41,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:41,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1560293058, now seen corresponding path program 1 times [2023-12-25 03:27:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126611125] [2023-12-25 03:27:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:41,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:41,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:41,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:41,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:27:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:41,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 03:27:41,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:27:41,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:27:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:27:42,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126611125] [2023-12-25 03:27:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126611125] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:27:42,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:27:42,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-25 03:27:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810583909] [2023-12-25 03:27:42,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:27:42,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:27:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:27:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:27:42,453 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:27:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:42,800 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2023-12-25 03:27:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:27:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (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 37 [2023-12-25 03:27:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:42,803 INFO L225 Difference]: With dead ends: 126 [2023-12-25 03:27:42,803 INFO L226 Difference]: Without dead ends: 122 [2023-12-25 03:27:42,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:27:42,804 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:42,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 87 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:27:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-25 03:27:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2023-12-25 03:27:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 03:27:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2023-12-25 03:27:42,816 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 37 [2023-12-25 03:27:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:42,816 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2023-12-25 03:27:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:27:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2023-12-25 03:27:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 03:27:42,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:42,817 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:42,822 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 03:27:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:43,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:43,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 367273510, now seen corresponding path program 1 times [2023-12-25 03:27:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374392779] [2023-12-25 03:27:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:43,022 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:43,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:27:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:43,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 03:27:43,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 03:27:43,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:27:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 03:27:43,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374392779] [2023-12-25 03:27:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374392779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:27:43,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:27:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-25 03:27:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213511550] [2023-12-25 03:27:43,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:27:43,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 03:27:43,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 03:27:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:27:43,203 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 03:27:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:27:43,836 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2023-12-25 03:27:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:27:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 50 [2023-12-25 03:27:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:27:43,838 INFO L225 Difference]: With dead ends: 242 [2023-12-25 03:27:43,838 INFO L226 Difference]: Without dead ends: 221 [2023-12-25 03:27:43,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:27:43,839 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 73 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:27:43,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 195 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 03:27:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-25 03:27:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2023-12-25 03:27:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 03:27:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 260 transitions. [2023-12-25 03:27:43,859 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 260 transitions. Word has length 50 [2023-12-25 03:27:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:27:43,860 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 260 transitions. [2023-12-25 03:27:43,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 03:27:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 260 transitions. [2023-12-25 03:27:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 03:27:43,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:27:43,861 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:27:43,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:27:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:44,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:27:44,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:27:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -293585845, now seen corresponding path program 1 times [2023-12-25 03:27:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:27:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922495289] [2023-12-25 03:27:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:27:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:27:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:27:44,064 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:27:44,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 03:27:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:27:44,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:27:44,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:27:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:27:44,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:27:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:27:48,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:27:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922495289] [2023-12-25 03:27:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922495289] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:27:48,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:27:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 03:27:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183451967] [2023-12-25 03:27:48,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:27:48,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 03:27:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:27:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 03:27:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:27:48,892 INFO L87 Difference]: Start difference. First operand 214 states and 260 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:27:56,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:28:04,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:28:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:28:07,794 INFO L93 Difference]: Finished difference Result 376 states and 477 transitions. [2023-12-25 03:28:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 03:28:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 59 [2023-12-25 03:28:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:28:07,802 INFO L225 Difference]: With dead ends: 376 [2023-12-25 03:28:07,802 INFO L226 Difference]: Without dead ends: 300 [2023-12-25 03:28:07,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2023-12-25 03:28:07,803 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 74 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 80 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:28:07,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 261 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2023-12-25 03:28:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-25 03:28:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2023-12-25 03:28:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 175 states have internal predecessors, (200), 49 states have call successors, (49), 32 states have call predecessors, (49), 32 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-25 03:28:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 295 transitions. [2023-12-25 03:28:07,837 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 295 transitions. Word has length 59 [2023-12-25 03:28:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:28:07,838 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 295 transitions. [2023-12-25 03:28:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:28:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 295 transitions. [2023-12-25 03:28:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 03:28:07,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:28:07,843 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:28:07,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-25 03:28:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:28:08,048 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:28:08,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:28:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 433404212, now seen corresponding path program 2 times [2023-12-25 03:28:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:28:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387388089] [2023-12-25 03:28:08,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:28:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:28:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:28:08,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:28:08,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 03:28:08,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:28:08,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:28:08,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:28:08,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:28:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 03:28:08,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:28:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 03:28:09,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:28:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387388089] [2023-12-25 03:28:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387388089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:28:09,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:28:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-25 03:28:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569494844] [2023-12-25 03:28:09,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:28:09,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:28:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:28:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:28:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:28:09,634 INFO L87 Difference]: Start difference. First operand 250 states and 295 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 03:28:14,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:28:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:28:15,985 INFO L93 Difference]: Finished difference Result 326 states and 392 transitions. [2023-12-25 03:28:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 03:28:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 64 [2023-12-25 03:28:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:28:15,989 INFO L225 Difference]: With dead ends: 326 [2023-12-25 03:28:15,989 INFO L226 Difference]: Without dead ends: 260 [2023-12-25 03:28:15,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-12-25 03:28:15,990 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:28:15,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 343 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2023-12-25 03:28:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-25 03:28:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2023-12-25 03:28:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 179 states have internal predecessors, (199), 49 states have call successors, (49), 34 states have call predecessors, (49), 33 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 03:28:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 293 transitions. [2023-12-25 03:28:16,021 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 293 transitions. Word has length 64 [2023-12-25 03:28:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:28:16,021 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 293 transitions. [2023-12-25 03:28:16,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 03:28:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 293 transitions. [2023-12-25 03:28:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 03:28:16,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:28:16,024 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:28:16,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 03:28:16,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:28:16,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:28:16,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:28:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1181721499, now seen corresponding path program 1 times [2023-12-25 03:28:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:28:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929177758] [2023-12-25 03:28:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:28:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:28:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:28:16,236 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:28:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 03:28:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:28:16,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:28:16,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:28:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-12-25 03:28:16,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:28:18,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:28:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929177758] [2023-12-25 03:28:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929177758] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:28:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [529906598] [2023-12-25 03:28:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:28:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:28:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:28:18,821 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:28:18,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-25 03:28:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:28:18,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 03:28:18,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:28:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-12-25 03:28:19,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:28:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-12-25 03:28:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [529906598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:28:51,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:28:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2023-12-25 03:28:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132538716] [2023-12-25 03:28:51,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:28:51,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 03:28:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:28:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 03:28:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=537, Unknown=2, NotChecked=0, Total=650 [2023-12-25 03:28:51,639 INFO L87 Difference]: Start difference. First operand 257 states and 293 transitions. Second operand has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 14 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:29:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:29:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:29:13,080 INFO L93 Difference]: Finished difference Result 280 states and 322 transitions. [2023-12-25 03:29:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 03:29:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 14 states have call predecessors, (30), 12 states have call successors, (30) Word has length 70 [2023-12-25 03:29:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:29:13,081 INFO L225 Difference]: With dead ends: 280 [2023-12-25 03:29:13,081 INFO L226 Difference]: Without dead ends: 248 [2023-12-25 03:29:13,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=252, Invalid=1152, Unknown=2, NotChecked=0, Total=1406 [2023-12-25 03:29:13,082 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:29:13,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 318 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-12-25 03:29:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-12-25 03:29:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2023-12-25 03:29:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 155 states have (on average 1.1548387096774193) internal successors, (179), 160 states have internal predecessors, (179), 45 states have call successors, (45), 30 states have call predecessors, (45), 29 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-25 03:29:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 265 transitions. [2023-12-25 03:29:13,111 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 265 transitions. Word has length 70 [2023-12-25 03:29:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:29:13,111 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 265 transitions. [2023-12-25 03:29:13,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 14 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 14 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:29:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 265 transitions. [2023-12-25 03:29:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-25 03:29:13,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:29:13,112 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:29:13,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-12-25 03:29:13,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 03:29:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:29:13,516 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:29:13,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:29:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash -808682318, now seen corresponding path program 2 times [2023-12-25 03:29:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:29:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169040231] [2023-12-25 03:29:13,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:29:13,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:29:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:29:13,518 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:29:13,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 03:29:13,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:29:13,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:29:13,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:29:13,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:29:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 03:29:13,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:29:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 03:29:13,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:29:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169040231] [2023-12-25 03:29:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169040231] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:29:13,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:29:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 03:29:13,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334149821] [2023-12-25 03:29:13,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:29:13,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:29:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:29:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:29:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:29:13,767 INFO L87 Difference]: Start difference. First operand 230 states and 265 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-25 03:29:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:29:14,109 INFO L93 Difference]: Finished difference Result 298 states and 370 transitions. [2023-12-25 03:29:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:29:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 88 [2023-12-25 03:29:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:29:14,110 INFO L225 Difference]: With dead ends: 298 [2023-12-25 03:29:14,110 INFO L226 Difference]: Without dead ends: 249 [2023-12-25 03:29:14,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:29:14,111 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:29:14,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:29:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-25 03:29:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2023-12-25 03:29:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 50 states have call successors, (50), 28 states have call predecessors, (50), 28 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-25 03:29:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 282 transitions. [2023-12-25 03:29:14,160 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 282 transitions. Word has length 88 [2023-12-25 03:29:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:29:14,160 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 282 transitions. [2023-12-25 03:29:14,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-25 03:29:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 282 transitions. [2023-12-25 03:29:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 03:29:14,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:29:14,161 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 03:29:14,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 03:29:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:29:14,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:29:14,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:29:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1566685696, now seen corresponding path program 3 times [2023-12-25 03:29:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:29:14,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086091600] [2023-12-25 03:29:14,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:29:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:29:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:29:14,367 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:29:14,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 03:29:14,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-25 03:29:14,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 03:29:14,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 03:29:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 03:29:14,863 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 03:29:14,864 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 03:29:14,864 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:29:14,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 03:29:15,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:29:15,069 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:29:15,071 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:29:15,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:29:15 BoogieIcfgContainer [2023-12-25 03:29:15,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:29:15,099 INFO L158 Benchmark]: Toolchain (without parser) took 97330.75ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 176.7MB in the beginning and 209.3MB in the end (delta: -32.6MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2023-12-25 03:29:15,099 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:29:15,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.86ms. Allocated memory is still 227.5MB. Free memory was 176.7MB in the beginning and 165.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:29:15,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.47ms. Allocated memory is still 227.5MB. Free memory was 165.1MB in the beginning and 163.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:29:15,099 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 227.5MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:29:15,099 INFO L158 Benchmark]: RCFGBuilder took 310.91ms. Allocated memory is still 227.5MB. Free memory was 161.5MB in the beginning and 148.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:29:15,100 INFO L158 Benchmark]: TraceAbstraction took 96808.00ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 147.8MB in the beginning and 209.3MB in the end (delta: -61.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:29:15,100 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.13ms. Allocated memory is still 175.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 148.86ms. Allocated memory is still 227.5MB. Free memory was 176.7MB in the beginning and 165.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.47ms. Allocated memory is still 227.5MB. Free memory was 165.1MB in the beginning and 163.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 227.5MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.91ms. Allocated memory is still 227.5MB. Free memory was 161.5MB in the beginning and 148.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 96808.00ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 147.8MB in the beginning and 209.3MB in the end (delta: -61.5MB). There was no memory consumed. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int A, B; [L25] unsigned int r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=-1649321, B=-1073807360, counter=0, d=-1073807360, p=1, q=0, r=-1649321] [L35] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=1, d=-1073807360, p=1, q=0, r=-1649321] [L35] COND TRUE counter++<10 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=-1649321, B=-1073807360, counter=1, d=-1073807360, p=1, q=0, r=-1649321] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=-1649321, B=-1073807360, counter=1, d=-1073807360, p=1, q=0, r=-1649321] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=-1649321, B=-1073807360, counter=1, d=-1073807360, p=1, q=0, r=-1649321] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=-1649321, B=-1073807360, counter=1, d=2147352576, p=2, q=0, r=-1649321] [L35] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=2, d=2147352576, p=2, q=0, r=-1649321] [L35] COND TRUE counter++<10 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=-1649321, B=-1073807360, counter=2, d=2147352576, p=2, q=0, r=-1649321] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=-1649321, B=-1073807360, counter=2, d=2147352576, p=2, q=0, r=-1649321] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=-1649321, B=-1073807360, counter=2, d=2147352576, p=2, q=0, r=-1649321] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=-1649321, B=-1073807360, counter=2, d=-262144, p=4, q=0, r=-1649321] [L35] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=3, d=-262144, p=4, q=0, r=-1649321] [L35] COND TRUE counter++<10 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(q == 0) VAL [A=-1649321, B=-1073807360, counter=3, d=-262144, p=4, q=0, r=-1649321] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(r == A) VAL [A=-1649321, B=-1073807360, counter=3, d=-262144, p=4, q=0, r=-1649321] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=-1649321, B=-1073807360, counter=3, d=-262144, p=4, q=0, r=-1649321] [L39] COND TRUE !(r >= d) VAL [A=-1649321, B=-1073807360, counter=3, d=-262144, p=4, q=0, r=-1649321] [L45] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=4, d=-262144, p=4, q=0, r=-1649321] [L45] COND TRUE counter++<10 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L46] RET __VERIFIER_assert(A == q*B + r) VAL [A=-1649321, B=-1073807360, counter=4, d=-262144, p=4, q=0, r=-1649321] [L47] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L47] RET __VERIFIER_assert(d == B*p) VAL [A=-1649321, B=-1073807360, counter=4, d=-262144, p=4, q=0, r=-1649321] [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 VAL [A=-1649321, B=-1073807360, counter=4, d=2147352576, p=2, q=0, r=-1649321] [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p VAL [A=-1649321, B=-1073807360, counter=4, d=2147352576, p=2, q=2, r=2145965399] [L45] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=5, d=2147352576, p=2, q=2, r=2145965399] [L45] COND TRUE counter++<10 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L46] RET __VERIFIER_assert(A == q*B + r) VAL [A=-1649321, B=-1073807360, counter=5, d=2147352576, p=2, q=2, r=2145965399] [L47] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L47] RET __VERIFIER_assert(d == B*p) VAL [A=-1649321, B=-1073807360, counter=5, d=2147352576, p=2, q=2, r=2145965399] [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 VAL [A=-1649321, B=-1073807360, counter=5, d=1073676288, p=1, q=2, r=2145965399] [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p VAL [A=-1649321, B=-1073807360, counter=5, d=1073676288, p=1, q=3, r=1072289111] [L45] EXPR counter++ VAL [A=-1649321, B=-1073807360, counter=6, d=1073676288, p=1, q=3, r=1072289111] [L45] COND TRUE counter++<10 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.7s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 48.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 2104 SdHoareTripleChecker+Invalid, 29.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1641 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1199 IncrementalHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 463 mSDtfsCounter, 1199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1024 GetRequests, 888 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 48.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=12, InterpolantAutomatonStates: 118, 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, 14 MinimizatonAttempts, 117 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 2189/2405 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 proved your program to be incorrect! [2023-12-25 03:29:15,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...