/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:29:07,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:29:07,112 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:29:07,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:29:07,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:29:07,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:29:07,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:29:07,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:29:07,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:29:07,130 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:29:07,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:29:07,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:29:07,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:29:07,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:29:07,131 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:29:07,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:29:07,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:29:07,132 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:29:07,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:29:07,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:29:07,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:29:07,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:29:07,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:29:07,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:29:07,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:29:07,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:29:07,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:29:07,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:29:07,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:29:07,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:29:07,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:29:07,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:29:07,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:29:07,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:29:07,137 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:29:07,137 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:29:07,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:29:07,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:29:07,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:29:07,333 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:29:07,333 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:29:07,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c [2023-12-25 01:29:08,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:29:08,795 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:29:08,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c [2023-12-25 01:29:08,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8539cbe/e9d19b3224724b9290cfb815857ad8d5/FLAG8f23714aa [2023-12-25 01:29:08,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8539cbe/e9d19b3224724b9290cfb815857ad8d5 [2023-12-25 01:29:08,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:29:08,846 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:29:08,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:29:08,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:29:08,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:29:08,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:29:08" (1/1) ... [2023-12-25 01:29:08,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c2fd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:08, skipping insertion in model container [2023-12-25 01:29:08,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:29:08" (1/1) ... [2023-12-25 01:29:08,868 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:29:08,963 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2023-12-25 01:29:08,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:29:08,989 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:29:09,000 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2023-12-25 01:29:09,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:29:09,025 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:29:09,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09 WrapperNode [2023-12-25 01:29:09,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:29:09,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:29:09,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:29:09,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:29:09,033 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:29:09" (1/1) ... [2023-12-25 01:29:09,047 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:29:09" (1/1) ... [2023-12-25 01:29:09,064 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2023-12-25 01:29:09,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:29:09,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:29:09,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:29:09,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:29:09,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,095 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:29:09,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:29:09,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:29:09,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:29:09,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:29:09,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (1/1) ... [2023-12-25 01:29:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:29:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:29:09,135 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:29:09,139 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:29:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:29:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:29:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:29:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:29:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:29:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:29:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:29:09,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:29:09,222 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:29:09,225 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:29:09,420 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:29:09,454 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:29:09,454 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 01:29:09,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:29:09 BoogieIcfgContainer [2023-12-25 01:29:09,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:29:09,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:29:09,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:29:09,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:29:09,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:29:08" (1/3) ... [2023-12-25 01:29:09,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b3a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:29:09, skipping insertion in model container [2023-12-25 01:29:09,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:29:09" (2/3) ... [2023-12-25 01:29:09,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b3a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:29:09, skipping insertion in model container [2023-12-25 01:29:09,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:29:09" (3/3) ... [2023-12-25 01:29:09,462 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound10.c [2023-12-25 01:29:09,475 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:29:09,476 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:29:09,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:29:09,512 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;@5fa1aac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:29:09,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:29:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:29:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 01:29:09,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:09,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:09,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:09,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2138951705, now seen corresponding path program 1 times [2023-12-25 01:29:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137491846] [2023-12-25 01:29:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:09,536 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:29:09,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:09,563 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:29:09,596 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:29:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:09,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:29:09,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 01:29:09,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:09,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137491846] [2023-12-25 01:29:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137491846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:29:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588478267] [2023-12-25 01:29:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:09,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:29:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:29:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:29:09,730 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:29:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:09,757 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2023-12-25 01:29:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:29:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 01:29:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:09,764 INFO L225 Difference]: With dead ends: 52 [2023-12-25 01:29:09,765 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:29:09,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:29:09,771 INFO L413 NwaCegarLoop]: 34 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, 34 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:29:09,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:29:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:29:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:29:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:29:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-25 01:29:09,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2023-12-25 01:29:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:09,803 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-25 01:29:09,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:29:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-25 01:29:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:29:09,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:09,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:09,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 01:29:10,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:29:10,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:10,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash -443127421, now seen corresponding path program 1 times [2023-12-25 01:29:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571532670] [2023-12-25 01:29:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:10,012 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:29:10,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:10,013 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:29:10,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:29:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:10,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 01:29:10,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:10,120 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:29:10,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:10,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571532670] [2023-12-25 01:29:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571532670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:10,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:10,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:29:10,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804538505] [2023-12-25 01:29:10,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:10,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 01:29:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 01:29:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:29:10,127 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:29:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:10,142 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-25 01:29:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 01:29:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 01:29:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:10,143 INFO L225 Difference]: With dead ends: 37 [2023-12-25 01:29:10,143 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 01:29:10,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:29:10,145 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:10,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:29:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 01:29:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 01:29:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:29:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-25 01:29:10,151 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2023-12-25 01:29:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:10,152 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-25 01:29:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:29:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-25 01:29:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:29:10,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:10,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:10,157 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:29:10,355 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:29:10,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:10,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash -441459125, now seen corresponding path program 1 times [2023-12-25 01:29:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:10,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858584805] [2023-12-25 01:29:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:10,357 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:29:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:10,358 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:29:10,360 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:29:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:10,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 01:29:10,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:10,560 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:29:10,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:10,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858584805] [2023-12-25 01:29:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858584805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:29:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903498812] [2023-12-25 01:29:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:10,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:29:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:29:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:29:10,567 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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:29:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:11,694 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-12-25 01:29:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:29:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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:29:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:11,707 INFO L225 Difference]: With dead ends: 44 [2023-12-25 01:29:11,707 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 01:29:11,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:29:11,708 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:11,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 01:29:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 01:29:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-25 01:29:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 01:29:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-12-25 01:29:11,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2023-12-25 01:29:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:11,719 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-12-25 01:29:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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:29:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-12-25 01:29:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 01:29:11,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:11,720 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:29:11,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:29:11,927 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:29:11,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:11,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1203735897, now seen corresponding path program 1 times [2023-12-25 01:29:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819082614] [2023-12-25 01:29:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:11,929 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:29:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:11,933 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:29:11,941 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:29:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:12,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:29:12,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:29:12,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:12,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819082614] [2023-12-25 01:29:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819082614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 01:29:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787696114] [2023-12-25 01:29:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:12,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 01:29:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 01:29:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:29:12,366 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:29:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:14,363 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-25 01:29:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:29:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-12-25 01:29:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:14,376 INFO L225 Difference]: With dead ends: 48 [2023-12-25 01:29:14,376 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 01:29:14,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:29:14,377 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:14,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 199 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 01:29:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 01:29:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 01:29:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 01:29:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2023-12-25 01:29:14,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2023-12-25 01:29:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:14,389 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-12-25 01:29:14,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:29:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2023-12-25 01:29:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:29:14,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:14,390 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:14,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 01:29:14,596 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:29:14,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:14,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash 705122187, now seen corresponding path program 1 times [2023-12-25 01:29:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:14,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016959598] [2023-12-25 01:29:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:14,598 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:29:14,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:14,599 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:29:14,610 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:29:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:14,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:29:14,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 01:29:15,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:15,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016959598] [2023-12-25 01:29:15,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016959598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:15,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:15,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 01:29:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824000157] [2023-12-25 01:29:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:15,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 01:29:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 01:29:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:29:15,044 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:29:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:17,607 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2023-12-25 01:29:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:29:17,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-12-25 01:29:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:17,613 INFO L225 Difference]: With dead ends: 70 [2023-12-25 01:29:17,613 INFO L226 Difference]: Without dead ends: 66 [2023-12-25 01:29:17,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:29:17,614 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:17,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 158 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-25 01:29:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-25 01:29:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-25 01:29:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 01:29:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2023-12-25 01:29:17,636 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 28 [2023-12-25 01:29:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2023-12-25 01:29:17,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:29:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2023-12-25 01:29:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 01:29:17,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:17,645 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:17,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:29:17,854 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:29:17,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:17,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1795283768, now seen corresponding path program 1 times [2023-12-25 01:29:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847443645] [2023-12-25 01:29:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:17,859 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:29:17,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:17,860 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:29:17,861 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:29:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:18,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 01:29:18,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:29:18,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:18,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847443645] [2023-12-25 01:29:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847443645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:18,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:18,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:29:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677668476] [2023-12-25 01:29:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:18,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:29:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:29:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:29:18,111 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 01:29:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:19,881 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2023-12-25 01:29:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:29:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2023-12-25 01:29:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:19,896 INFO L225 Difference]: With dead ends: 82 [2023-12-25 01:29:19,896 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 01:29:19,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:29:19,897 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:19,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 01:29:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 01:29:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2023-12-25 01:29:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-25 01:29:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2023-12-25 01:29:19,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 34 [2023-12-25 01:29:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:19,910 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2023-12-25 01:29:19,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 01:29:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2023-12-25 01:29:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 01:29:19,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:19,911 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:19,920 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:29:20,120 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:29:20,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:20,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -427827123, now seen corresponding path program 1 times [2023-12-25 01:29:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130049010] [2023-12-25 01:29:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:20,121 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:29:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:20,122 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:29:20,124 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:29:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:20,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:29:20,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:29:20,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:29:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:29:20,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130049010] [2023-12-25 01:29:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130049010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:29:20,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:29:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 01:29:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307894038] [2023-12-25 01:29:20,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:29:20,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:29:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:20,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:29:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:29:20,472 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:29:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:27,314 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2023-12-25 01:29:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:29:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-12-25 01:29:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:27,327 INFO L225 Difference]: With dead ends: 217 [2023-12-25 01:29:27,327 INFO L226 Difference]: Without dead ends: 195 [2023-12-25 01:29:27,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:29:27,328 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:27,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 123 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-25 01:29:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-25 01:29:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-12-25 01:29:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 118 states have internal predecessors, (131), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 01:29:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2023-12-25 01:29:27,368 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 37 [2023-12-25 01:29:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:27,368 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2023-12-25 01:29:27,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:29:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2023-12-25 01:29:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 01:29:27,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:27,373 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:27,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:29:27,581 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:29:27,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:27,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -426158827, now seen corresponding path program 1 times [2023-12-25 01:29:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145485410] [2023-12-25 01:29:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:27,583 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:29:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:27,584 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:29:27,636 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:29:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:27,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:29:27,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 01:29:27,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:29:27,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145485410] [2023-12-25 01:29:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145485410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:29:28,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:29:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:29:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860769700] [2023-12-25 01:29:28,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:29:28,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:29:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:28,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:29:28,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:29:28,001 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:29:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:29:28,983 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2023-12-25 01:29:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:29:28,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-25 01:29:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:29:29,000 INFO L225 Difference]: With dead ends: 203 [2023-12-25 01:29:29,000 INFO L226 Difference]: Without dead ends: 198 [2023-12-25 01:29:29,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:29:29,001 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:29:29,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 105 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 01:29:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-25 01:29:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-12-25 01:29:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-25 01:29:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2023-12-25 01:29:29,033 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2023-12-25 01:29:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:29:29,033 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2023-12-25 01:29:29,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:29:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2023-12-25 01:29:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 01:29:29,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:29:29,034 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:29:29,062 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:29:29,246 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:29:29,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:29:29,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:29:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1298990710, now seen corresponding path program 1 times [2023-12-25 01:29:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:29:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266686177] [2023-12-25 01:29:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:29:29,248 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:29:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:29:29,250 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:29:29,251 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:29:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:29:29,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 01:29:29,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:29:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:29:29,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:30:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:30:06,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:30:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266686177] [2023-12-25 01:30:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266686177] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:30:06,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:30:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-12-25 01:30:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354597982] [2023-12-25 01:30:06,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:30:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:30:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:30:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:30:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:30:06,868 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 01:30:08,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:12,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:19,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:22,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:31,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:40,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:42,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:43,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:46,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:49,189 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:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:30:49,387 INFO L93 Difference]: Finished difference Result 215 states and 267 transitions. [2023-12-25 01:30:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 01:30:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2023-12-25 01:30:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:30:49,406 INFO L225 Difference]: With dead ends: 215 [2023-12-25 01:30:49,406 INFO L226 Difference]: Without dead ends: 199 [2023-12-25 01:30:49,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:30:49,407 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:30:49,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 29.3s Time] [2023-12-25 01:30:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-25 01:30:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-12-25 01:30:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 128 states have internal predecessors, (140), 53 states have call successors, (53), 25 states have call predecessors, (53), 25 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-25 01:30:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2023-12-25 01:30:49,428 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 39 [2023-12-25 01:30:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:30:49,428 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2023-12-25 01:30:49,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 01:30:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2023-12-25 01:30:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:30:49,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:30:49,429 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:30:49,442 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:30:49,638 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:30:49,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:30:49,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:30:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1786533347, now seen corresponding path program 2 times [2023-12-25 01:30:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:30:49,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812242703] [2023-12-25 01:30:49,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:30:49,639 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:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:30:49,640 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:30:49,642 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:30:53,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:30:53,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:30:53,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 01:30:53,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:30:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 01:30:54,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:31:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 01:31:32,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:31:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812242703] [2023-12-25 01:31:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812242703] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:31:32,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:31:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 01:31:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987170093] [2023-12-25 01:31:32,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:31:32,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:31:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:31:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:31:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:31:32,405 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 01:31:36,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:40,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:45,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:49,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:10,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:15,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:18,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:31,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:56,785 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:32:58,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:58,821 INFO L93 Difference]: Finished difference Result 243 states and 305 transitions. [2023-12-25 01:32:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:32:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 42 [2023-12-25 01:32:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:58,843 INFO L225 Difference]: With dead ends: 243 [2023-12-25 01:32:58,843 INFO L226 Difference]: Without dead ends: 241 [2023-12-25 01:32:58,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2023-12-25 01:32:58,844 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 48 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:58,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 269 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 186 Invalid, 4 Unknown, 0 Unchecked, 43.3s Time] [2023-12-25 01:32:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-25 01:32:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2023-12-25 01:32:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 147 states have internal predecessors, (164), 59 states have call successors, (59), 28 states have call predecessors, (59), 28 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-25 01:32:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2023-12-25 01:32:58,896 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 42 [2023-12-25 01:32:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:58,896 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2023-12-25 01:32:58,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 01:32:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2023-12-25 01:32:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 01:32:58,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:58,899 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:58,915 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:32:59,112 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:32:59,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:59,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1675496919, now seen corresponding path program 1 times [2023-12-25 01:32:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378253026] [2023-12-25 01:32:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:59,113 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:32:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:59,115 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:32:59,148 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 Received shutdown request... [2023-12-25 01:43:56,819 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:43:56,848 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:43:57,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-25 01:43:58,049 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forcibly destroying the process [2023-12-25 01:43:58,082 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 137 [2023-12-25 01:43:58,083 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-25 01:43:58,085 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:43:58,085 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 48 with TraceHistMax 6,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1378253026] and IpTcStrategyModuleCvc4 [1010368657]. [2023-12-25 01:43:58,089 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:43:58,106 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:43:58,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:43:58 BoogieIcfgContainer [2023-12-25 01:43:58,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:43:58,107 INFO L158 Benchmark]: Toolchain (without parser) took 889262.14ms. Allocated memory is still 244.3MB. Free memory was 198.0MB in the beginning and 200.7MB in the end (delta: -2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:43:58,108 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:43:58,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.01ms. Allocated memory is still 244.3MB. Free memory was 198.0MB in the beginning and 185.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:43:58,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.38ms. Allocated memory is still 244.3MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:43:58,109 INFO L158 Benchmark]: Boogie Preprocessor took 44.16ms. Allocated memory is still 244.3MB. Free memory was 183.9MB in the beginning and 182.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:43:58,109 INFO L158 Benchmark]: RCFGBuilder took 345.42ms. Allocated memory is still 244.3MB. Free memory was 182.3MB in the beginning and 168.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 01:43:58,109 INFO L158 Benchmark]: TraceAbstraction took 888650.82ms. Allocated memory is still 244.3MB. Free memory was 167.6MB in the beginning and 200.7MB in the end (delta: -33.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:43:58,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.01ms. Allocated memory is still 244.3MB. Free memory was 198.0MB in the beginning and 185.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.38ms. Allocated memory is still 244.3MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.16ms. Allocated memory is still 244.3MB. Free memory was 183.9MB in the beginning and 182.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.42ms. Allocated memory is still 244.3MB. Free memory was 182.3MB in the beginning and 168.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 888650.82ms. Allocated memory is still 244.3MB. Free memory was 167.6MB in the beginning and 200.7MB in the end (delta: -33.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 48 with TraceHistMax 6,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1378253026] and IpTcStrategyModuleCvc4 [1010368657]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 888.6s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 144.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 87.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 1351 SdHoareTripleChecker+Invalid, 83.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1042 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 309 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 100.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=10, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 77.9s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729 SizeOfPredicates, 24 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 249/277 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown