/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:30:42,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:30:42,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:30:42,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:30:42,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:30:42,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:30:42,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:30:42,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:30:42,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:30:42,476 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:30:42,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:30:42,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:30:42,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:30:42,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:30:42,478 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:30:42,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:30:42,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:30:42,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:30:42,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:30:42,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:30:42,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:30:42,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:30:42,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:30:42,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:30:42,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:30:42,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:30:42,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:30:42,482 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:30:42,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:30:42,482 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:30:42,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:30:42,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:30:42,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:30:42,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:30:42,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:30:42,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:30:42,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:30:42,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:30:42,485 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:30:42,485 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:30:42,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:30:42,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:30:42,486 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:30:42,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:30:42,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:30:42,486 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:30:42,486 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:30:42,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:30:42,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:30:42,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:30:42,747 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:30:42,751 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:30:42,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c [2023-12-25 03:30:43,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:30:44,170 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:30:44,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c [2023-12-25 03:30:44,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2991d5ef/a908b41043e74a51818ced7f5ec8d2cf/FLAG4b500acde [2023-12-25 03:30:44,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2991d5ef/a908b41043e74a51818ced7f5ec8d2cf [2023-12-25 03:30:44,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:30:44,198 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:30:44,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:30:44,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:30:44,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:30:44,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0dfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44, skipping insertion in model container [2023-12-25 03:30:44,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,229 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:30:44,385 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2023-12-25 03:30:44,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:30:44,420 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:30:44,433 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2023-12-25 03:30:44,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:30:44,467 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:30:44,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44 WrapperNode [2023-12-25 03:30:44,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:30:44,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:30:44,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:30:44,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:30:44,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,512 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-12-25 03:30:44,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:30:44,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:30:44,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:30:44,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:30:44,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 03:30:44,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:30:44,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:30:44,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:30:44,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:30:44,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (1/1) ... [2023-12-25 03:30:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:30:44,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:30:44,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:30:44,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:30:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:30:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:30:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:30:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:30:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:30:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:30:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:30:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:30:44,680 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:30:44,684 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:30:44,872 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:30:44,902 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:30:44,902 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:30:44,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:30:44 BoogieIcfgContainer [2023-12-25 03:30:44,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:30:44,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:30:44,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:30:44,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:30:44,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:30:44" (1/3) ... [2023-12-25 03:30:44,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9360fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:30:44, skipping insertion in model container [2023-12-25 03:30:44,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:30:44" (2/3) ... [2023-12-25 03:30:44,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9360fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:30:44, skipping insertion in model container [2023-12-25 03:30:44,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:30:44" (3/3) ... [2023-12-25 03:30:44,910 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2023-12-25 03:30:44,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:30:44,925 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:30:44,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:30:44,975 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;@189f978f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:30:44,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:30:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 03:30:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:30:44,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:44,986 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 03:30:44,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:44,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2023-12-25 03:30:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939150520] [2023-12-25 03:30:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:45,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:45,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:45,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:30:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:45,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:30:45,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:45,111 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 03:30:45,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:45,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939150520] [2023-12-25 03:30:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939150520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:30:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87388477] [2023-12-25 03:30:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:45,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:30:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:30:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:30:45,142 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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 03:30:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:45,166 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2023-12-25 03:30:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:30:45,168 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 03:30:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:45,172 INFO L225 Difference]: With dead ends: 58 [2023-12-25 03:30:45,172 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 03:30:45,174 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 03:30:45,177 INFO L413 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:45,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:30:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 03:30:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 03:30:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:30:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 03:30:45,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2023-12-25 03:30:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:45,209 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 03:30:45,209 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 03:30:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 03:30:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:30:45,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:45,210 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 03:30:45,219 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 03:30:45,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:45,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:45,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2023-12-25 03:30:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033404894] [2023-12-25 03:30:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:45,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:30:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:45,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:30:45,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:45,507 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 03:30:45,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:45,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033404894] [2023-12-25 03:30:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033404894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:45,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:30:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478105097] [2023-12-25 03:30:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:45,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:30:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:45,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:30:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:30:45,511 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:30:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:45,605 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-25 03:30:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:30:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 03:30:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:45,609 INFO L225 Difference]: With dead ends: 41 [2023-12-25 03:30:45,609 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 03:30:45,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:30:45,610 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:45,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:30:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 03:30:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 03:30:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:30:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 03:30:45,624 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-12-25 03:30:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:45,624 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 03:30:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:30:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 03:30:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:30:45,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:45,626 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] [2023-12-25 03:30:45,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 03:30:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:45,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:45,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2023-12-25 03:30:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819228989] [2023-12-25 03:30:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:45,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:45,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:45,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 03:30:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:45,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:30:45,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:45,909 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 03:30:45,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:45,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819228989] [2023-12-25 03:30:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819228989] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:45,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:30:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583304271] [2023-12-25 03:30:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:45,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:30:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:45,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:30:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:30:45,912 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 03:30:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:46,046 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-25 03:30:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:30:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 28 [2023-12-25 03:30:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:46,047 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:30:46,047 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:30:46,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:30:46,049 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:46,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:30:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:30:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-12-25 03:30:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:30:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-12-25 03:30:46,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2023-12-25 03:30:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-12-25 03:30:46,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 03:30:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-12-25 03:30:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 03:30:46,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:46,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:46,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 03:30:46,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:46,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:46,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2023-12-25 03:30:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274814263] [2023-12-25 03:30:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:46,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:46,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:46,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:30:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:46,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:30:46,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 03:30:46,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:46,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:46,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274814263] [2023-12-25 03:30:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274814263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:46,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:46,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 03:30:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79189250] [2023-12-25 03:30:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:46,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 03:30:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 03:30:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:30:46,526 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 03:30:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:46,822 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2023-12-25 03:30:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 03:30:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2023-12-25 03:30:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:46,824 INFO L225 Difference]: With dead ends: 64 [2023-12-25 03:30:46,824 INFO L226 Difference]: Without dead ends: 50 [2023-12-25 03:30:46,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:30:46,826 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:46,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 137 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:30:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-25 03:30:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-25 03:30:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 03:30:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2023-12-25 03:30:46,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 33 [2023-12-25 03:30:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:46,842 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2023-12-25 03:30:46,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 03:30:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2023-12-25 03:30:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 03:30:46,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:46,845 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:46,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 03:30:47,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:47,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:47,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2023-12-25 03:30:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:47,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544551065] [2023-12-25 03:30:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:47,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:47,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:30:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:47,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:30:47,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:30:47,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:47,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544551065] [2023-12-25 03:30:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544551065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 03:30:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794325893] [2023-12-25 03:30:47,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:47,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 03:30:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 03:30:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:30:47,436 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:30:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:47,743 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-12-25 03:30:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 03:30:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-12-25 03:30:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:47,745 INFO L225 Difference]: With dead ends: 64 [2023-12-25 03:30:47,745 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 03:30:47,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:30:47,746 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:47,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:30:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 03:30:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 03:30:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 03:30:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-12-25 03:30:47,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2023-12-25 03:30:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:47,756 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-12-25 03:30:47,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:30:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-12-25 03:30:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 03:30:47,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:47,757 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:47,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 03:30:47,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:47,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:47,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2023-12-25 03:30:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360160326] [2023-12-25 03:30:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:47,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:47,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:30:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:48,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 03:30:48,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 03:30:48,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:30:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 03:30:49,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:49,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360160326] [2023-12-25 03:30:49,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360160326] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:30:49,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:30:49,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-25 03:30:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585648593] [2023-12-25 03:30:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:49,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:30:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:49,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:30:49,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:30:49,052 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:30:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:49,542 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2023-12-25 03:30:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:30:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2023-12-25 03:30:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:49,544 INFO L225 Difference]: With dead ends: 65 [2023-12-25 03:30:49,544 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 03:30:49,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:30:49,545 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:49,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 134 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 03:30:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 03:30:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2023-12-25 03:30:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 03:30:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-12-25 03:30:49,556 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 50 [2023-12-25 03:30:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:49,556 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-12-25 03:30:49,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:30:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-12-25 03:30:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 03:30:49,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:49,558 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:49,566 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 03:30:49,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:49,761 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:49,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2057146835, now seen corresponding path program 1 times [2023-12-25 03:30:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155943881] [2023-12-25 03:30:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:49,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:49,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 03:30:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:49,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:30:49,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 03:30:50,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:30:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 03:30:51,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155943881] [2023-12-25 03:30:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155943881] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:30:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:30:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2023-12-25 03:30:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972851199] [2023-12-25 03:30:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:30:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:30:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:30:51,320 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:30:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:52,028 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-12-25 03:30:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:30:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2023-12-25 03:30:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:52,037 INFO L225 Difference]: With dead ends: 79 [2023-12-25 03:30:52,037 INFO L226 Difference]: Without dead ends: 77 [2023-12-25 03:30:52,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:30:52,038 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:52,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 03:30:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-25 03:30:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2023-12-25 03:30:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 03:30:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-12-25 03:30:52,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 57 [2023-12-25 03:30:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:52,060 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-12-25 03:30:52,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:30:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-12-25 03:30:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-25 03:30:52,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:52,062 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:52,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 03:30:52,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:52,263 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:52,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash 961839043, now seen corresponding path program 1 times [2023-12-25 03:30:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294081355] [2023-12-25 03:30:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:52,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:52,266 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:52,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 03:30:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:52,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:30:52,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:30:52,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:30:52,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294081355] [2023-12-25 03:30:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294081355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:30:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:30:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:30:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65143572] [2023-12-25 03:30:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:30:52,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:30:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:30:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:30:52,445 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 03:30:54,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 03:30:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:30:54,347 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-12-25 03:30:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:30:54,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 68 [2023-12-25 03:30:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:30:54,348 INFO L225 Difference]: With dead ends: 78 [2023-12-25 03:30:54,348 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 03:30:54,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:30:54,349 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 03:30:54,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 03:30:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 03:30:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-25 03:30:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 03:30:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2023-12-25 03:30:54,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 68 [2023-12-25 03:30:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:30:54,369 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2023-12-25 03:30:54,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 03:30:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2023-12-25 03:30:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 03:30:54,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:30:54,371 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:30:54,380 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 03:30:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:54,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:30:54,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:30:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2023-12-25 03:30:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:30:54,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128038441] [2023-12-25 03:30:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:30:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:30:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:30:54,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:30:54,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:30:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:30:54,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 03:30:54,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:30:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:30:55,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:30:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-25 03:30:59,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:30:59,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128038441] [2023-12-25 03:30:59,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128038441] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:30:59,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:30:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2023-12-25 03:30:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406613781] [2023-12-25 03:30:59,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:30:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 03:30:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:30:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 03:30:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2023-12-25 03:30:59,968 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-25 03:31:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:04,264 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2023-12-25 03:31:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 03:31:04,269 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 70 [2023-12-25 03:31:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:04,270 INFO L225 Difference]: With dead ends: 113 [2023-12-25 03:31:04,270 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 03:31:04,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2023-12-25 03:31:04,272 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:04,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 275 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-25 03:31:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 03:31:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-25 03:31:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 03:31:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-12-25 03:31:04,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 70 [2023-12-25 03:31:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:04,288 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-12-25 03:31:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-25 03:31:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-12-25 03:31:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 03:31:04,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:04,292 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:04,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 03:31:04,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:04,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:04,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2023-12-25 03:31:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524455778] [2023-12-25 03:31:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:04,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:04,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:04,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:04,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:31:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:04,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 03:31:04,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-25 03:31:05,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-25 03:31:09,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524455778] [2023-12-25 03:31:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524455778] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:31:09,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:31:09,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2023-12-25 03:31:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828326447] [2023-12-25 03:31:09,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:31:09,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 03:31:09,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 03:31:09,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 03:31:09,547 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 03:31:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:12,689 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-12-25 03:31:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 03:31:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) Word has length 81 [2023-12-25 03:31:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:12,692 INFO L225 Difference]: With dead ends: 84 [2023-12-25 03:31:12,692 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 03:31:12,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2023-12-25 03:31:12,693 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:12,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 214 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 03:31:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 03:31:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 03:31:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:31:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 03:31:12,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2023-12-25 03:31:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:12,695 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 03:31:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 03:31:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 03:31:12,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 03:31:12,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:31:12,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:31:12,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:12,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 03:31:16,841 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) [2023-12-25 03:31:16,841 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-12-25 03:31:16,841 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse2 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse3 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse2 .cse3) (and (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse0 .cse1 (bvule |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse2 .cse3 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:31:16,842 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse2 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse3 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse2 .cse3) (and (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse0 .cse1 (bvule |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse2 .cse3 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse2 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse3 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse2 .cse3) (and (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse0 .cse1 (bvule |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse2 .cse3 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:31:16,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 03:31:16,842 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-25 03:31:16,842 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse2 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (let ((.cse0 (bvneg |ULTIMATE.start_main_~d~0#1|))) (and (exists ((|v_ULTIMATE.start_main_~d~0#1_36| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv (bvmul |v_ULTIMATE.start_main_~d~0#1_36| (_ bv2 32)) (_ bv2 32))) (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse0) |ULTIMATE.start_main_~r~0#1|) |v_ULTIMATE.start_main_~d~0#1_36|) (bvuge |v_ULTIMATE.start_main_~d~0#1_36| (_ bv1 32)))) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0)) .cse1 (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse0)) .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (not .cse3) .cse4 .cse5 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) .cse1))) [2023-12-25 03:31:16,842 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)))) (or (let ((.cse0 (bvneg |ULTIMATE.start_main_~d~0#1|))) (and (exists ((|v_ULTIMATE.start_main_~d~0#1_36| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv (bvmul |v_ULTIMATE.start_main_~d~0#1_36| (_ bv2 32)) (_ bv2 32))) (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse0) |ULTIMATE.start_main_~r~0#1|) |v_ULTIMATE.start_main_~d~0#1_36|) (bvuge |v_ULTIMATE.start_main_~d~0#1_36| (_ bv1 32)))) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0)) (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse0)) .cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)) .cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 03:31:16,843 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse2 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse3 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|) .cse2 .cse3) (and (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse0 .cse1 (bvule |ULTIMATE.start_main_~d~0#1| (_ bv1 32)) .cse2 .cse3 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:31:16,843 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-12-25 03:31:16,843 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse2 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (let ((.cse0 (bvneg |ULTIMATE.start_main_~d~0#1|))) (and (exists ((|v_ULTIMATE.start_main_~d~0#1_36| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv (bvmul |v_ULTIMATE.start_main_~d~0#1_36| (_ bv2 32)) (_ bv2 32))) (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse0) |ULTIMATE.start_main_~r~0#1|) |v_ULTIMATE.start_main_~d~0#1_36|) (bvuge |v_ULTIMATE.start_main_~d~0#1_36| (_ bv1 32)))) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0)) .cse1 (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse0)) .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (not .cse3) .cse4 .cse5 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) .cse1))) [2023-12-25 03:31:16,843 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse2 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse4 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (let ((.cse0 (bvneg |ULTIMATE.start_main_~d~0#1|))) (and (exists ((|v_ULTIMATE.start_main_~d~0#1_36| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv (bvmul |v_ULTIMATE.start_main_~d~0#1_36| (_ bv2 32)) (_ bv2 32))) (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse0) |ULTIMATE.start_main_~r~0#1|) |v_ULTIMATE.start_main_~d~0#1_36|) (bvuge |v_ULTIMATE.start_main_~d~0#1_36| (_ bv1 32)))) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~B~0#1|) .cse0)) .cse1 (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse0)) .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (not .cse3) .cse4 .cse5 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (and (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) .cse1))) [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:31:16,843 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-25 03:31:16,843 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:31:16,844 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 03:31:16,844 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 03:31:16,844 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:31:16,844 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:31:16,844 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 03:31:16,844 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 03:31:16,847 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:16,848 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:31:16,857 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~d~0#1_36 : bv32 :: (~d~0 == ~bvudiv~32(~bvmul~32(v_ULTIMATE.start_main_~d~0#1_36, 2bv32), 2bv32) && ~bvuge~32(~bvadd~32(~bvmul~32(4294967295bv32, ~bvneg~32(~d~0)), ~r~0), v_ULTIMATE.start_main_~d~0#1_36)) && ~bvuge~32(v_ULTIMATE.start_main_~d~0#1_36, 1bv32)) could not be translated [2023-12-25 03:31:16,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:31:16 BoogieIcfgContainer [2023-12-25 03:31:16,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:31:16,863 INFO L158 Benchmark]: Toolchain (without parser) took 32665.10ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 150.4MB in the beginning and 218.7MB in the end (delta: -68.3MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,863 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:31:16,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.46ms. Allocated memory is still 194.0MB. Free memory was 150.1MB in the beginning and 138.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.42ms. Allocated memory is still 194.0MB. Free memory was 138.5MB in the beginning and 137.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,864 INFO L158 Benchmark]: Boogie Preprocessor took 37.26ms. Allocated memory is still 194.0MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,864 INFO L158 Benchmark]: RCFGBuilder took 351.47ms. Allocated memory is still 194.0MB. Free memory was 135.1MB in the beginning and 122.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,864 INFO L158 Benchmark]: TraceAbstraction took 31957.57ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 122.2MB in the beginning and 218.7MB in the end (delta: -96.6MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. [2023-12-25 03:31:16,865 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.14ms. Allocated memory is still 194.0MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.46ms. Allocated memory is still 194.0MB. Free memory was 150.1MB in the beginning and 138.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.42ms. Allocated memory is still 194.0MB. Free memory was 138.5MB in the beginning and 137.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.26ms. Allocated memory is still 194.0MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.47ms. Allocated memory is still 194.0MB. Free memory was 135.1MB in the beginning and 122.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 31957.57ms. Allocated memory was 194.0MB in the beginning and 250.6MB in the end (delta: 56.6MB). Free memory was 122.2MB in the beginning and 218.7MB in the end (delta: -96.6MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~d~0#1_36 : bv32 :: (~d~0 == ~bvudiv~32(~bvmul~32(v_ULTIMATE.start_main_~d~0#1_36, 2bv32), 2bv32) && ~bvuge~32(~bvadd~32(~bvmul~32(4294967295bv32, ~bvneg~32(~d~0)), ~r~0), v_ULTIMATE.start_main_~d~0#1_36)) && ~bvuge~32(v_ULTIMATE.start_main_~d~0#1_36, 1bv32)) could not be translated * 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1368 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 314 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 735 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=8, InterpolantAutomatonStates: 75, 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, 10 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 61 PreInvPairs, 84 NumberOfFragments, 566 HoareAnnotationTreeSize, 61 FormulaSimplifications, 449 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FormulaSimplificationsInter, 400 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 717 ConstructedInterpolants, 24 QuantifiedInterpolants, 3268 SizeOfPredicates, 31 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 1235/1279 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((A == ((r + B) % 4294967296)) && (A <= 1)) && (r == ((A + -(d)) % 4294967296))) && (B <= 1)) && (q == 1)) || ((((((d == B) && !((r >= B))) && (r == A)) && (q == 0)) && (B <= 1)) && (p == 1))) || ((((((((B * 2) == d) && (r == A)) && (q == 0)) && (p == 2)) && (r >= B)) && (B >= 1)) && (A <= 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((B * 2) == d) && (r == A)) && (q == 0)) && (p == 2)) && (r >= B)) && (B >= 1)) && (A <= 1)) || ((((((((d >= 1) && (r == A)) && (q == 0)) && (d <= 1)) && (B >= 1)) && (A <= 1)) && (B <= 1)) && (p == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 03:31:16,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...