/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/prod4br-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:24:01,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:24:01,595 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 04:24:01,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:24:01,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:24:01,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:24:01,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:24:01,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:24:01,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:24:01,628 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:24:01,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:24:01,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:24:01,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:24:01,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:24:01,631 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:24:01,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:24:01,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:24:01,631 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:24:01,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:24:01,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:24:01,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:24:01,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:24:01,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:24:01,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:24:01,633 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:24:01,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:24:01,634 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:24:01,634 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:24:01,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:24:01,634 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:24:01,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:24:01,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:24:01,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:24:01,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:24:01,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:24:01,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:24:01,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:24:01,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:24:01,637 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:24:01,637 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 04:24:01,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:24:01,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:24:01,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:24:01,856 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:24:01,856 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:24:01,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2023-12-25 04:24:02,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:24:03,047 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:24:03,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2023-12-25 04:24:03,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5586ec97f/ce23cc731b2f495b9fdafd1bbb6e086e/FLAGd35ca742d [2023-12-25 04:24:03,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5586ec97f/ce23cc731b2f495b9fdafd1bbb6e086e [2023-12-25 04:24:03,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:24:03,081 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:24:03,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:24:03,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:24:03,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:24:03,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f0a26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03, skipping insertion in model container [2023-12-25 04:24:03,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,115 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:24:03,238 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/prod4br-ll_valuebound10.c[524,537] [2023-12-25 04:24:03,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:24:03,277 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:24:03,288 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/prod4br-ll_valuebound10.c[524,537] [2023-12-25 04:24:03,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:24:03,316 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:24:03,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03 WrapperNode [2023-12-25 04:24:03,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:24:03,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:24:03,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:24:03,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:24:03,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,345 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-25 04:24:03,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:24:03,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:24:03,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:24:03,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:24:03,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,374 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 04:24:03,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:24:03,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:24:03,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:24:03,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:24:03,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (1/1) ... [2023-12-25 04:24:03,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:24:03,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:24:03,419 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 04:24:03,452 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 04:24:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:24:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:24:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:24:03,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:24:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:24:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:24:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:24:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:24:03,523 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:24:03,526 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:24:04,411 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:24:04,429 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:24:04,430 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:24:04,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:24:04 BoogieIcfgContainer [2023-12-25 04:24:04,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:24:04,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:24:04,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:24:04,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:24:04,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:24:03" (1/3) ... [2023-12-25 04:24:04,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad542bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:24:04, skipping insertion in model container [2023-12-25 04:24:04,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:03" (2/3) ... [2023-12-25 04:24:04,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad542bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:24:04, skipping insertion in model container [2023-12-25 04:24:04,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:24:04" (3/3) ... [2023-12-25 04:24:04,436 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.c [2023-12-25 04:24:04,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:24:04,449 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:24:04,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:24:04,484 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;@1a5eecd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:24:04,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:24:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:24:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:24:04,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:04,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:04,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:04,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1790489630, now seen corresponding path program 1 times [2023-12-25 04:24:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967897952] [2023-12-25 04:24:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:04,506 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 04:24:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:04,522 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 04:24:04,526 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 04:24:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:04,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:24:04,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:04,697 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 04:24:04,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:24:04,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:24:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967897952] [2023-12-25 04:24:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967897952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:24:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:24:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:24:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859930431] [2023-12-25 04:24:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:24:04,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:24:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:24:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:24:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:24:04,733 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:24:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:24:04,762 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2023-12-25 04:24:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:24:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 04:24:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:24:04,769 INFO L225 Difference]: With dead ends: 50 [2023-12-25 04:24:04,769 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 04:24:04,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 04:24:04,775 INFO L413 NwaCegarLoop]: 31 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, 31 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 04:24:04,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:24:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 04:24:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 04:24:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:24:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 04:24:04,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2023-12-25 04:24:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:24:04,804 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 04:24:04,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:24:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 04:24:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:24:04,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:04,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:04,827 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 04:24:05,012 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 04:24:05,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:05,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 641782300, now seen corresponding path program 1 times [2023-12-25 04:24:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293419745] [2023-12-25 04:24:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:05,015 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 04:24:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:05,016 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 04:24:05,017 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 04:24:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:05,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:24:05,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:24:05,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:24:05,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:24:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293419745] [2023-12-25 04:24:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293419745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:24:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:24:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 04:24:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113087740] [2023-12-25 04:24:05,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:24:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 04:24:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:24:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 04:24:05,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:24:05,686 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:24:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:24:07,459 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-25 04:24:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:24:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-12-25 04:24:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:24:07,468 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:24:07,468 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 04:24:07,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:24:07,469 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:24:07,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 80 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 04:24:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 04:24:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-12-25 04:24:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:24:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-25 04:24:07,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-12-25 04:24:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:24:07,479 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-25 04:24:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:24:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-25 04:24:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:24:07,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:07,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:07,499 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 04:24:07,681 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 04:24:07,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:07,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1418577099, now seen corresponding path program 1 times [2023-12-25 04:24:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271202960] [2023-12-25 04:24:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:07,683 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 04:24:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:07,684 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 04:24:07,692 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 04:24:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:07,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:24:07,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:24:08,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:24:08,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:24:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271202960] [2023-12-25 04:24:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271202960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:24:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:24:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 04:24:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275480488] [2023-12-25 04:24:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:24:08,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 04:24:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:24:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 04:24:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 04:24:08,345 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:24:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:24:10,186 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-25 04:24:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 04:24:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-12-25 04:24:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:24:10,195 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:24:10,195 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 04:24:10,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:24:10,196 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:24:10,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 04:24:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 04:24:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 04:24:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:24:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:24:10,203 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-12-25 04:24:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:24:10,203 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:24:10,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:24:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:24:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 04:24:10,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:10,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:10,213 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 04:24:10,410 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 04:24:10,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:10,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1440936176, now seen corresponding path program 1 times [2023-12-25 04:24:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:10,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531967453] [2023-12-25 04:24:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:10,412 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 04:24:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:10,413 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 04:24:10,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 04:24:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:10,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 04:24:10,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:24:24,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:25:18,885 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:26:04,759 WARN L293 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:26:18,531 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:26:28,739 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:26:43,389 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:26:49,697 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|)))) (or (= (bvadd |c_ULTIMATE.start_main_~q~0#1| (bvmul (bvmul (bvsdiv |c_ULTIMATE.start_main_~b~0#1| (_ bv2 64)) (bvsdiv |c_ULTIMATE.start_main_~a~0#1| (_ bv2 64)) |c_ULTIMATE.start_main_~p~0#1|) (_ bv4 64))) .cse0) (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~q~0#1| (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~p~0#1|)))) (not (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~b~0#1| (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~a~0#1| (_ bv2 64)))))) is different from true [2023-12-25 04:26:59,106 WARN L293 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:04,278 WARN L293 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:10,340 WARN L293 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:32,865 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:27:41,247 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:59,425 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |c_ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:28:16,366 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:28:29,681 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:28:46,330 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:29:11,758 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:29:24,642 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:29:41,572 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:29:49,839 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:29:58,703 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (or (= (bvmul (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))) (_ bv4 64)) (bvmul .cse1 .cse0)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) (not (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv10 32))) (not (= (bvsrem .cse1 (_ bv2 64)) (_ bv0 64)))))) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))))) is different from true [2023-12-25 04:29:58,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:29:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531967453] [2023-12-25 04:29:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531967453] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:29:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1096855208] [2023-12-25 04:29:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:29:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:29:58,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:29:58,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:29:58,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 04:29:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:29:59,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 04:29:59,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:30:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:30:07,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:31:13,584 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:31:48,286 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:31:57,030 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19|)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvmul .cse0 .cse1) (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:32:18,298 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:32:44,192 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:32:52,771 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19|)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvmul .cse0 .cse1) (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:33:09,821 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:33:18,135 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:33:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1096855208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:33:22,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:33:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 14 [2023-12-25 04:33:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893562798] [2023-12-25 04:33:22,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:33:22,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:33:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:33:22,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:33:22,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=285, Unknown=10, NotChecked=328, Total=702 [2023-12-25 04:33:22,527 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:33:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:33:39,928 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2023-12-25 04:33:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 04:33:39,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2023-12-25 04:33:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:33:39,942 INFO L225 Difference]: With dead ends: 52 [2023-12-25 04:33:39,943 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 04:33:39,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 140.7s TimeCoverageRelationStatistics Valid=98, Invalid=386, Unknown=10, NotChecked=376, Total=870 [2023-12-25 04:33:39,944 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:33:39,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 129 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-25 04:33:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 04:33:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-12-25 04:33:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:33:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2023-12-25 04:33:39,949 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2023-12-25 04:33:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:33:39,949 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2023-12-25 04:33:39,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:33:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2023-12-25 04:33:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:33:39,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:33:39,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:33:39,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 04:33:40,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-25 04:33:40,353 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 04:33:40,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:33:40,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:33:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash 404329846, now seen corresponding path program 1 times [2023-12-25 04:33:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:33:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163451115] [2023-12-25 04:33:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:33:40,355 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 04:33:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:33:40,356 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 04:33:40,358 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 04:33:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:33:40,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:33:40,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:33:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:33:41,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:34:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:34:31,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:34:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163451115] [2023-12-25 04:34:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163451115] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:34:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:34:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-12-25 04:34:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730233191] [2023-12-25 04:34:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:34:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 04:34:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:34:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 04:34:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 04:34:31,951 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 04:34:33,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:46,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:50,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:54,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:58,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:00,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:07,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:08,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:12,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:16,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:20,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:22,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:26,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:31,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:36,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:38,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:39,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:35:45,080 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2023-12-25 04:35:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 04:35:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-25 04:35:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:35:45,128 INFO L225 Difference]: With dead ends: 60 [2023-12-25 04:35:45,128 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 04:35:45,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:35:45,130 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.9s IncrementalHoareTripleChecker+Time [2023-12-25 04:35:45,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 70.9s Time] [2023-12-25 04:35:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 04:35:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-12-25 04:35:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:35:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2023-12-25 04:35:45,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 32 [2023-12-25 04:35:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:35:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-12-25 04:35:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 04:35:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2023-12-25 04:35:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 04:35:45,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:35:45,139 INFO L195 NwaCegarLoop]: trace histogram [3, 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 04:35:45,155 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 (7)] Ended with exit code 0 [2023-12-25 04:35:45,355 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 04:35:45,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:35:45,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:35:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1916147435, now seen corresponding path program 1 times [2023-12-25 04:35:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:35:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342408042] [2023-12-25 04:35:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:35:45,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 04:35:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:35:45,358 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 04:35:45,361 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 04:35:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:35:45,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:35:45,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:35:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:35:47,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:37:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:37:05,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:37:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342408042] [2023-12-25 04:37:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342408042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:37:05,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:37:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2023-12-25 04:37:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620996622] [2023-12-25 04:37:05,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:37:05,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 04:37:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:37:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 04:37:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-25 04:37:05,182 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 04:37:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:43,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:48,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:52,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:58,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:38:02,165 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 04:38:20,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:38:24,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:38:28,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:38:32,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:38:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:39,772 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2023-12-25 04:38:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 04:38:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 33 [2023-12-25 04:38:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:39,790 INFO L225 Difference]: With dead ends: 97 [2023-12-25 04:38:39,790 INFO L226 Difference]: Without dead ends: 72 [2023-12-25 04:38:39,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 89.9s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:38:39,791 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:38:39,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 266 Invalid, 10 Unknown, 0 Unchecked, 65.0s Time] [2023-12-25 04:38:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-25 04:38:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2023-12-25 04:38:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 48 states have internal predecessors, (56), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:38:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2023-12-25 04:38:39,804 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 33 [2023-12-25 04:38:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:39,804 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2023-12-25 04:38:39,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 04:38:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2023-12-25 04:38:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:38:39,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:39,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:39,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 04:38:40,012 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 04:38:40,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:40,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -748842225, now seen corresponding path program 1 times [2023-12-25 04:38:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704870710] [2023-12-25 04:38:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:40,014 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 04:38:40,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:40,020 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 04:38:40,021 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 04:38:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:40,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 04:38:40,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 04:38:42,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 04:38:50,002 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 04:38:50,040 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:38:50,499 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:38:50,509 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 04:38:50,700 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 04:38:50,701 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 39 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while TransFormulaUtils was doing sequential composition of 5 TransFormulas,while SimplifyDDA2 was simplifying a ∧-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. [2023-12-25 04:38:50,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:50,717 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:38:50,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:38:50 BoogieIcfgContainer [2023-12-25 04:38:50,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:38:50,722 INFO L158 Benchmark]: Toolchain (without parser) took 887641.20ms. Allocated memory is still 334.5MB. Free memory was 292.2MB in the beginning and 226.6MB in the end (delta: 65.6MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,723 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 190.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:38:50,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.37ms. Allocated memory is still 334.5MB. Free memory was 292.0MB in the beginning and 280.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 334.5MB. Free memory was 280.2MB in the beginning and 278.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,727 INFO L158 Benchmark]: Boogie Preprocessor took 49.49ms. Allocated memory is still 334.5MB. Free memory was 278.5MB in the beginning and 276.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,727 INFO L158 Benchmark]: RCFGBuilder took 1034.21ms. Allocated memory is still 334.5MB. Free memory was 276.7MB in the beginning and 263.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,728 INFO L158 Benchmark]: TraceAbstraction took 886289.96ms. Allocated memory is still 334.5MB. Free memory was 262.7MB in the beginning and 226.6MB in the end (delta: 36.2MB). Peak memory consumption was 37.1MB. Max. memory is 8.0GB. [2023-12-25 04:38:50,729 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.51ms. Allocated memory is still 190.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.37ms. Allocated memory is still 334.5MB. Free memory was 292.0MB in the beginning and 280.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 334.5MB. Free memory was 280.2MB in the beginning and 278.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.49ms. Allocated memory is still 334.5MB. Free memory was 278.5MB in the beginning and 276.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1034.21ms. Allocated memory is still 334.5MB. Free memory was 276.7MB in the beginning and 263.4MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 886289.96ms. Allocated memory is still 334.5MB. Free memory was 262.7MB in the beginning and 226.6MB in the end (delta: 36.2MB). Peak memory consumption was 37.1MB. 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: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 39 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while TransFormulaUtils was doing sequential composition of 5 TransFormulas,while SimplifyDDA2 was simplifying a ∧-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.2s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 188.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 145.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 623 SdHoareTripleChecker+Invalid, 140.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 842 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 113 mSDtfsCounter, 842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 267.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 683.7s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 1959 SizeOfPredicates, 28 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 117/134 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