/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/divbin_unwindbound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:20:30,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:20:30,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:20:30,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:20:30,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:20:30,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:20:30,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:20:30,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:20:30,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:20:30,514 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:20:30,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:20:30,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:20:30,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:20:30,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:20:30,516 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:20:30,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:20:30,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:20:30,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:20:30,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:20:30,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:20:30,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:20:30,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:20:30,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:20:30,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:20:30,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:20:30,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:20:30,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:20:30,519 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:20:30,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:20:30,520 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:20:30,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:20:30,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:20:30,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:20:30,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:20:30,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:20:30,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:20:30,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:20:30,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:20:30,522 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:20:30,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:20:30,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:20:30,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:20:30,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:20:30,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:20:30,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:20:30,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:20:30,763 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:20:30,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound100.i [2023-12-25 01:20:31,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:20:32,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:20:32,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound100.i [2023-12-25 01:20:32,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4cac235/ace54a2ae24142bebb6eb6da3ab38603/FLAG9627d3023 [2023-12-25 01:20:32,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4cac235/ace54a2ae24142bebb6eb6da3ab38603 [2023-12-25 01:20:32,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:20:32,126 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:20:32,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:20:32,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:20:32,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:20:32,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528eeb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32, skipping insertion in model container [2023-12-25 01:20:32,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,156 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:20:32,312 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/divbin_unwindbound100.i[950,963] [2023-12-25 01:20:32,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:20:32,337 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:20:32,348 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/divbin_unwindbound100.i[950,963] [2023-12-25 01:20:32,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:20:32,376 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:20:32,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32 WrapperNode [2023-12-25 01:20:32,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:20:32,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:20:32,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:20:32,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:20:32,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,410 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 01:20:32,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:20:32,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:20:32,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:20:32,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:20:32,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,433 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:20:32,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:20:32,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:20:32,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:20:32,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:20:32,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (1/1) ... [2023-12-25 01:20:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:20:32,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:20:32,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:20:32,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:20:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:20:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:20:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:20:32,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:20:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:20:32,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:20:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:20:32,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:20:32,545 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:20:32,547 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:20:32,671 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:20:32,709 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:20:32,710 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:20:32,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:20:32 BoogieIcfgContainer [2023-12-25 01:20:32,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:20:32,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:20:32,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:20:32,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:20:32,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:20:32" (1/3) ... [2023-12-25 01:20:32,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ef4900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:20:32, skipping insertion in model container [2023-12-25 01:20:32,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:20:32" (2/3) ... [2023-12-25 01:20:32,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ef4900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:20:32, skipping insertion in model container [2023-12-25 01:20:32,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:20:32" (3/3) ... [2023-12-25 01:20:32,721 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound100.i [2023-12-25 01:20:32,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:20:32,741 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:20:32,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:20:32,795 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;@654a71e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:20:32,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:20:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:20:32,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:32,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:32,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:32,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -627064806, now seen corresponding path program 1 times [2023-12-25 01:20:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132026587] [2023-12-25 01:20:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:32,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:20:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:32,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:20:32,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:32,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:20:32,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132026587] [2023-12-25 01:20:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132026587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:20:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:20:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:20:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479064325] [2023-12-25 01:20:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:20:32,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:20:32,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:20:32,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:20:32,938 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:32,961 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2023-12-25 01:20:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:20:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 01:20:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:32,969 INFO L225 Difference]: With dead ends: 48 [2023-12-25 01:20:32,970 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 01:20:32,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:20:32,975 INFO L413 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:32,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:20:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 01:20:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 01:20:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:20:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-25 01:20:33,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-25 01:20:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:33,004 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-25 01:20:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-25 01:20:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 01:20:33,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:33,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:33,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:20:33,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:33,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:33,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1502675692, now seen corresponding path program 1 times [2023-12-25 01:20:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537653010] [2023-12-25 01:20:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:33,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:33,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:20:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:33,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 01:20:33,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:33,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:20:33,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537653010] [2023-12-25 01:20:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537653010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:20:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:20:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:20:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940794678] [2023-12-25 01:20:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:20:33,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 01:20:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 01:20:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:20:33,344 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:33,371 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2023-12-25 01:20:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 01:20:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-25 01:20:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:33,372 INFO L225 Difference]: With dead ends: 37 [2023-12-25 01:20:33,373 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:20:33,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:20:33,374 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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 01:20:33,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:20:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:20:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:20:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:20:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-25 01:20:33,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 20 [2023-12-25 01:20:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:33,388 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-25 01:20:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-25 01:20:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 01:20:33,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:33,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:33,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 01:20:33,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:33,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:33,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1051975660, now seen corresponding path program 1 times [2023-12-25 01:20:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:33,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169982939] [2023-12-25 01:20:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:33,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:33,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:33,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:20:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:33,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:20:33,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:20:33,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:34,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169982939] [2023-12-25 01:20:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169982939] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:20:34,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:20:34,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-25 01:20:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198779141] [2023-12-25 01:20:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:20:34,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:20:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:20:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:20:34,768 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:35,346 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-12-25 01:20:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:20:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-25 01:20:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:35,357 INFO L225 Difference]: With dead ends: 37 [2023-12-25 01:20:35,357 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 01:20:35,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:20:35,359 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 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.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:35,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 01:20:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 01:20:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-25 01:20:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-12-25 01:20:35,366 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2023-12-25 01:20:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:35,367 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-12-25 01:20:35,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-12-25 01:20:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 01:20:35,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:35,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:35,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 01:20:35,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:35,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:35,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1626197479, now seen corresponding path program 1 times [2023-12-25 01:20:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203909806] [2023-12-25 01:20:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:35,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:35,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:20:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:35,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:20:35,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:35,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:35,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203909806] [2023-12-25 01:20:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203909806] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:35,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 01:20:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755989259] [2023-12-25 01:20:35,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:35,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:20:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:20:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:20:35,737 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:20:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:35,954 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-12-25 01:20:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:20:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-12-25 01:20:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:35,955 INFO L225 Difference]: With dead ends: 68 [2023-12-25 01:20:35,955 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 01:20:35,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:20:35,957 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:35,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:20:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 01:20:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2023-12-25 01:20:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-25 01:20:35,965 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2023-12-25 01:20:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:35,965 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-25 01:20:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:20:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-25 01:20:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 01:20:35,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:35,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:35,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:20:36,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:36,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 737203847, now seen corresponding path program 1 times [2023-12-25 01:20:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:36,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829154060] [2023-12-25 01:20:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:36,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:36,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:36,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:20:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:36,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:20:36,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:20:36,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:20:36,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829154060] [2023-12-25 01:20:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829154060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:20:36,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:20:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:20:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934825128] [2023-12-25 01:20:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:20:36,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:20:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:20:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:20:36,292 INFO L87 Difference]: Start difference. First operand 42 states and 51 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:36,427 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-12-25 01:20:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:20:36,428 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-25 01:20:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:36,429 INFO L225 Difference]: With dead ends: 54 [2023-12-25 01:20:36,429 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 01:20:36,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:20:36,430 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:36,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:20:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 01:20:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2023-12-25 01:20:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2023-12-25 01:20:36,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 24 [2023-12-25 01:20:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2023-12-25 01:20:36,440 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:20:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2023-12-25 01:20:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:20:36,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:36,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:36,448 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 (6)] Ended with exit code 0 [2023-12-25 01:20:36,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:36,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1831455308, now seen corresponding path program 1 times [2023-12-25 01:20:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94885334] [2023-12-25 01:20:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:36,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:36,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:36,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:20:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:36,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 01:20:36,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:36,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:20:36,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94885334] [2023-12-25 01:20:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94885334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:20:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:20:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:20:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598855299] [2023-12-25 01:20:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:20:36,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 01:20:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 01:20:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:20:36,715 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 01:20:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:36,742 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-12-25 01:20:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 01:20:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-12-25 01:20:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:36,743 INFO L225 Difference]: With dead ends: 69 [2023-12-25 01:20:36,743 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 01:20:36,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:20:36,744 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:36,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:20:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 01:20:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-25 01:20:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-25 01:20:36,753 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 30 [2023-12-25 01:20:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:36,754 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-25 01:20:36,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 01:20:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-25 01:20:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 01:20:36,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:36,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:36,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:20:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:36,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -736358239, now seen corresponding path program 1 times [2023-12-25 01:20:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951203367] [2023-12-25 01:20:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:36,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:36,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:36,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:20:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:37,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:20:37,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:37,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:20:40,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951203367] [2023-12-25 01:20:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951203367] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:40,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-25 01:20:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741771302] [2023-12-25 01:20:40,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:40,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 01:20:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 01:20:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:20:40,862 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:20:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:45,275 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2023-12-25 01:20:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 01:20:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2023-12-25 01:20:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:45,278 INFO L225 Difference]: With dead ends: 106 [2023-12-25 01:20:45,278 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 01:20:45,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 01:20:45,279 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:45,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 241 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 01:20:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 01:20:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2023-12-25 01:20:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 56 states have internal predecessors, (65), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:20:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-12-25 01:20:45,295 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 33 [2023-12-25 01:20:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:45,296 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-12-25 01:20:45,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:20:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-12-25 01:20:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:20:45,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:45,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:45,300 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 01:20:45,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:45,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:45,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1620601913, now seen corresponding path program 2 times [2023-12-25 01:20:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245184340] [2023-12-25 01:20:45,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:20:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:45,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:45,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:20:45,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:20:45,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:20:45,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:20:45,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:20:45,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:20:45,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245184340] [2023-12-25 01:20:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245184340] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:45,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2023-12-25 01:20:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322565479] [2023-12-25 01:20:45,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:45,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 01:20:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 01:20:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:20:45,869 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:20:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:46,044 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-12-25 01:20:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 01:20:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 42 [2023-12-25 01:20:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:46,046 INFO L225 Difference]: With dead ends: 86 [2023-12-25 01:20:46,046 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 01:20:46,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:20:46,047 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:46,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:20:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 01:20:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-12-25 01:20:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 01:20:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2023-12-25 01:20:46,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 42 [2023-12-25 01:20:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:46,062 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2023-12-25 01:20:46,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:20:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2023-12-25 01:20:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 01:20:46,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:46,063 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:46,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:20:46,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:46,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:46,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -682361828, now seen corresponding path program 1 times [2023-12-25 01:20:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019291107] [2023-12-25 01:20:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:20:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:46,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:46,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:46,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:20:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:20:46,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:20:46,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 01:20:46,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:20:46,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019291107] [2023-12-25 01:20:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019291107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:46,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:46,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 01:20:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454462132] [2023-12-25 01:20:46,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:46,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:20:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:20:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:20:46,556 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 01:20:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:47,309 INFO L93 Difference]: Finished difference Result 208 states and 253 transitions. [2023-12-25 01:20:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:20:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2023-12-25 01:20:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:47,316 INFO L225 Difference]: With dead ends: 208 [2023-12-25 01:20:47,316 INFO L226 Difference]: Without dead ends: 187 [2023-12-25 01:20:47,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:20:47,318 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 196 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:47,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 277 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:20:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-25 01:20:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 90. [2023-12-25 01:20:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 76 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:20:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-12-25 01:20:47,352 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 41 [2023-12-25 01:20:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:47,353 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-12-25 01:20:47,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 01:20:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-12-25 01:20:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:20:47,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:47,355 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:47,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:20:47,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:47,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:47,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1141376884, now seen corresponding path program 3 times [2023-12-25 01:20:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159547816] [2023-12-25 01:20:47,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:20:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:47,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:20:47,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:20:47,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:20:47,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:20:47,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:20:47,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 01:20:48,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:20:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 01:20:52,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159547816] [2023-12-25 01:20:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159547816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:52,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 01:20:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855095653] [2023-12-25 01:20:52,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 01:20:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 01:20:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:20:52,106 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:20:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:53,522 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2023-12-25 01:20:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:20:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2023-12-25 01:20:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:53,524 INFO L225 Difference]: With dead ends: 124 [2023-12-25 01:20:53,524 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 01:20:53,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:20:53,525 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:53,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 246 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 01:20:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 01:20:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 69. [2023-12-25 01:20:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 01:20:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-12-25 01:20:53,542 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 42 [2023-12-25 01:20:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:53,543 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-12-25 01:20:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:20:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-12-25 01:20:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 01:20:53,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:53,544 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:20:53,551 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 01:20:53,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:53,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:53,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2080148684, now seen corresponding path program 4 times [2023-12-25 01:20:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968052108] [2023-12-25 01:20:53,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:20:53,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:20:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:53,753 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 01:20:53,755 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 01:20:55,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:20:55,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:20:55,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 01:20:55,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:20:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:20:59,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:21:30,336 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:21:42,382 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:21:50,423 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:21:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:21:50,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:21:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968052108] [2023-12-25 01:21:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968052108] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:21:50,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:21:50,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-12-25 01:21:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124885950] [2023-12-25 01:21:50,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:21:50,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 01:21:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:21:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 01:21:50,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=444, Unknown=1, NotChecked=0, Total=552 [2023-12-25 01:21:50,579 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 01:21:54,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:21:56,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:01,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:05,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:07,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:25,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:31,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:22:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:35,028 INFO L93 Difference]: Finished difference Result 150 states and 191 transitions. [2023-12-25 01:22:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 01:22:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-12-25 01:22:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:35,034 INFO L225 Difference]: With dead ends: 150 [2023-12-25 01:22:35,034 INFO L226 Difference]: Without dead ends: 115 [2023-12-25 01:22:35,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=237, Invalid=882, Unknown=3, NotChecked=0, Total=1122 [2023-12-25 01:22:35,035 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:35,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 404 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 303 Invalid, 3 Unknown, 0 Unchecked, 24.4s Time] [2023-12-25 01:22:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-25 01:22:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2023-12-25 01:22:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 85 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:22:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-12-25 01:22:35,063 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 45 [2023-12-25 01:22:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:35,064 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-12-25 01:22:35,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 01:22:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-12-25 01:22:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 01:22:35,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:35,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:35,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:22:35,271 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 01:22:35,272 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:35,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1188718228, now seen corresponding path program 5 times [2023-12-25 01:22:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142861670] [2023-12-25 01:22:35,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 01:22:35,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:35,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:35,273 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 01:22:35,275 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 01:22:35,412 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-25 01:22:35,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:22:35,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:22:35,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:22:35,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:22:36,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142861670] [2023-12-25 01:22:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142861670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:22:36,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:22:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-25 01:22:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260883069] [2023-12-25 01:22:36,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:22:36,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:22:36,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:36,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:22:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:22:36,290 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 01:22:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:36,759 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2023-12-25 01:22:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:22:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 54 [2023-12-25 01:22:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:36,761 INFO L225 Difference]: With dead ends: 126 [2023-12-25 01:22:36,761 INFO L226 Difference]: Without dead ends: 100 [2023-12-25 01:22:36,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:22:36,762 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:36,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 238 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 01:22:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-25 01:22:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-25 01:22:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 85 states have internal predecessors, (98), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:22:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-12-25 01:22:36,789 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 54 [2023-12-25 01:22:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:36,789 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-12-25 01:22:36,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 01:22:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-12-25 01:22:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 01:22:36,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:36,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:36,797 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 01:22:36,994 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 01:22:36,995 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:36,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash -882275711, now seen corresponding path program 6 times [2023-12-25 01:22:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:36,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188542305] [2023-12-25 01:22:36,996 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 01:22:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:36,997 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 01:22:36,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 01:22:52,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-25 01:22:52,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:22:52,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 01:22:52,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:23:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 26 refuted. 9 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 01:23:23,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:24:23,373 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:40,840 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:24:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 01:24:44,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:24:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188542305] [2023-12-25 01:24:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188542305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:24:44,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:24:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-12-25 01:24:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572509525] [2023-12-25 01:24:44,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:24:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 01:24:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:24:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 01:24:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=759, Unknown=10, NotChecked=0, Total=930 [2023-12-25 01:24:44,978 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:25:17,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:25:20,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:25:24,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:25:47,787 WARN L293 SmtUtils]: Spent 12.71s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:25:48,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:25:53,283 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 [0] [2023-12-25 01:26:13,455 WARN L293 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 76 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:27:08,750 WARN L293 SmtUtils]: Spent 40.25s on a formula simplification. DAG size of input: 133 DAG size of output: 130 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:27:12,760 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 [0] [2023-12-25 01:27:16,768 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 [0] [2023-12-25 01:27:20,776 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 [0] [2023-12-25 01:27:24,821 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 [0] [2023-12-25 01:27:28,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:32,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:36,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:40,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:44,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:48,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:52,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:57,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:28:01,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:28:05,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:28:07,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:28:17,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:28:48,083 WARN L293 SmtUtils]: Spent 18.85s on a formula simplification. DAG size of input: 132 DAG size of output: 130 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:29:02,234 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:29:05,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:09,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:14,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:29:31,474 WARN L293 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 146 DAG size of output: 117 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:05,411 WARN L293 SmtUtils]: Spent 17.32s on a formula simplification. DAG size of input: 55 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:06,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:08,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:11,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:22,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:26,497 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 01:30:50,094 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 115 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:30:52,403 INFO L93 Difference]: Finished difference Result 156 states and 197 transitions. [2023-12-25 01:30:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 01:30:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2023-12-25 01:30:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:30:52,411 INFO L225 Difference]: With dead ends: 156 [2023-12-25 01:30:52,411 INFO L226 Difference]: Without dead ends: 151 [2023-12-25 01:30:52,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 325.9s TimeCoverageRelationStatistics Valid=536, Invalid=2086, Unknown=30, NotChecked=0, Total=2652 [2023-12-25 01:30:52,412 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 89 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:30:52,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 560 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 404 Invalid, 17 Unknown, 0 Unchecked, 114.6s Time] [2023-12-25 01:30:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-25 01:30:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2023-12-25 01:30:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 105 states have (on average 1.2) internal successors, (126), 109 states have internal predecessors, (126), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 01:30:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2023-12-25 01:30:52,467 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 57 [2023-12-25 01:30:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:30:52,467 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2023-12-25 01:30:52,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:30:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2023-12-25 01:30:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 01:30:52,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:30:52,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:30:52,483 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 01:30:52,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:30:52,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:30:52,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:30:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash -884063171, now seen corresponding path program 1 times [2023-12-25 01:30:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:30:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778869269] [2023-12-25 01:30:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:30:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:30:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:30:52,670 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:30:52,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 01:30:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:30:52,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:30:52,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:30:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:30:52,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:30:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:30:53,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:30:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778869269] [2023-12-25 01:30:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778869269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:30:53,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:30:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-12-25 01:30:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51458672] [2023-12-25 01:30:53,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:30:53,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 01:30:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:30:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 01:30:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:30:53,494 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 01:30:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:30:55,650 INFO L93 Difference]: Finished difference Result 735 states and 871 transitions. [2023-12-25 01:30:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 01:30:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 57 [2023-12-25 01:30:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:30:55,658 INFO L225 Difference]: With dead ends: 735 [2023-12-25 01:30:55,658 INFO L226 Difference]: Without dead ends: 728 [2023-12-25 01:30:55,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=423, Invalid=983, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 01:30:55,660 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 378 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:30:55,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 504 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 01:30:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2023-12-25 01:30:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 590. [2023-12-25 01:30:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 463 states have (on average 1.1576673866090712) internal successors, (536), 478 states have internal predecessors, (536), 76 states have call successors, (76), 50 states have call predecessors, (76), 50 states have return successors, (75), 61 states have call predecessors, (75), 75 states have call successors, (75) [2023-12-25 01:30:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 687 transitions. [2023-12-25 01:30:55,910 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 687 transitions. Word has length 57 [2023-12-25 01:30:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:30:55,911 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 687 transitions. [2023-12-25 01:30:55,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 01:30:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 687 transitions. [2023-12-25 01:30:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 01:30:55,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:30:55,912 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:30:55,923 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 01:30:56,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:30:56,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:30:56,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:30:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash 91567591, now seen corresponding path program 7 times [2023-12-25 01:30:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:30:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545775499] [2023-12-25 01:30:56,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 01:30:56,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:30:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:30:56,126 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 01:30:56,127 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 01:30:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 01:30:56,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 01:30:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 01:30:56,352 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 01:30:56,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 01:30:56,353 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:30:56,363 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 01:30:56,555 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 01:30:56,558 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:30:56,560 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:30:56,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:30:56 BoogieIcfgContainer [2023-12-25 01:30:56,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:30:56,594 INFO L158 Benchmark]: Toolchain (without parser) took 624468.47ms. Allocated memory is still 311.4MB. Free memory was 258.3MB in the beginning and 95.7MB in the end (delta: 162.6MB). Peak memory consumption was 163.7MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,595 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 204.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:30:56,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.39ms. Allocated memory is still 311.4MB. Free memory was 257.8MB in the beginning and 246.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 311.4MB. Free memory was 246.2MB in the beginning and 244.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,595 INFO L158 Benchmark]: Boogie Preprocessor took 32.70ms. Allocated memory is still 311.4MB. Free memory was 244.7MB in the beginning and 243.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,595 INFO L158 Benchmark]: RCFGBuilder took 266.06ms. Allocated memory is still 311.4MB. Free memory was 243.1MB in the beginning and 231.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,596 INFO L158 Benchmark]: TraceAbstraction took 623881.65ms. Allocated memory is still 311.4MB. Free memory was 230.5MB in the beginning and 95.7MB in the end (delta: 134.8MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. [2023-12-25 01:30:56,597 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.15ms. Allocated memory is still 204.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.39ms. Allocated memory is still 311.4MB. Free memory was 257.8MB in the beginning and 246.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 311.4MB. Free memory was 246.2MB in the beginning and 244.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.70ms. Allocated memory is still 311.4MB. Free memory was 244.7MB in the beginning and 243.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 266.06ms. Allocated memory is still 311.4MB. Free memory was 243.1MB in the beginning and 231.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 623881.65ms. Allocated memory is still 311.4MB. Free memory was 230.5MB in the beginning and 95.7MB in the end (delta: 134.8MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int counter = 0; [L27] unsigned A, B; [L28] unsigned q, r, b; [L29] A = __VERIFIER_nondet_uint() [L30] B = __VERIFIER_nondet_uint() [L31] CALL assume_abort_if_not(B < (0x7fffffff * 2U + 1U)/2) VAL [\old(cond)=1, counter=0] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L31] RET assume_abort_if_not(B < (0x7fffffff * 2U + 1U)/2) VAL [B=1431655767, counter=0] [L32] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, counter=0] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L32] RET assume_abort_if_not(B >= 1) VAL [B=1431655767, counter=0] [L33] q = 0 [L34] r = A [L35] b = B VAL [A=-1431655756, B=1431655767, b=1431655767, counter=0, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655767, counter=1, q=0, r=-1431655756] [L36] COND TRUE counter++<100 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=-1431655762, counter=1, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655762, counter=2, q=0, r=-1431655756] [L36] COND TRUE counter++<100 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=1431655772, counter=2, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655772, counter=3, q=0, r=-1431655756] [L36] COND TRUE counter++<100 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=3, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=4, q=0, r=-1431655756] [L36] COND TRUE counter++<100 [L37] COND TRUE !(r >= b) VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=4, q=0, r=-1431655756] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=5, q=0, r=-1431655756] [L40] COND TRUE counter++<100 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=5] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=5, q=0, r=-1431655756] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=1431655772, counter=5, q=0, r=-1431655756] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=1431655772, counter=5, q=1, r=1431655768] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655772, counter=6, q=1, r=1431655768] [L40] COND TRUE counter++<100 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=6] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=1431655772, counter=6, q=1, r=1431655768] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=715827886, counter=6, q=2, r=1431655768] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=715827886, counter=6, q=3, r=715827882] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=715827886, counter=7, q=3, r=715827882] [L40] COND TRUE counter++<100 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=7] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=715827886, counter=7, q=3, r=715827882] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=357913943, counter=7, q=6, r=715827882] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=357913943, counter=7, q=7, r=357913939] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=357913943, counter=8, q=7, r=357913939] [L40] COND TRUE counter++<100 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=8] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=357913943, counter=8, q=7, r=357913939] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=178956971, counter=8, q=14, r=357913939] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=178956971, counter=8, q=15, r=178956968] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=178956971, counter=9, q=15, r=178956968] [L40] COND TRUE counter++<100 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=0, counter=9] [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=9] [L21] reach_error() VAL [\old(cond)=0, cond=0, counter=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 623.8s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 422.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 144.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1039 mSDsluCounter, 3071 SdHoareTripleChecker+Invalid, 143.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2658 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1863 IncrementalHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 413 mSDtfsCounter, 1863 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 998 GetRequests, 746 SyntacticMatches, 3 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 372.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=14, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 361 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 17.8s SatisfiabilityAnalysisTime, 179.5s InterpolantComputationTime, 573 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 898 ConstructedInterpolants, 80 QuantifiedInterpolants, 9953 SizeOfPredicates, 38 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 346/692 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 01:30:56,762 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...