/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/egcd2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:46:48,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:46:48,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:46:48,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:46:48,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:46:48,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:46:48,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:46:48,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:46:48,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:46:48,233 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:46:48,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:46:48,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:46:48,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:46:48,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:46:48,234 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:46:48,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:46:48,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:46:48,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:46:48,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:46:48,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:46:48,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:46:48,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:46:48,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:46:48,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:46:48,241 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:46:48,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:46:48,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:46:48,242 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:46:48,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:46:48,242 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:46:48,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:46:48,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:46:48,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:46:48,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:46:48,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:46:48,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:46:48,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:46:48,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:46:48,244 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:46:48,244 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:46:48,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:46:48,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:46:48,248 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:46:48,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:46:48,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:46:48,249 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:46:48,249 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:46:48,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:46:48,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:46:48,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:46:48,471 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:46:48,471 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:46:48,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound2.c [2023-12-25 01:46:49,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:46:49,703 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:46:49,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound2.c [2023-12-25 01:46:49,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3cfca03/55eea23337f14fc2bb494ab72e156006/FLAG0406aa582 [2023-12-25 01:46:49,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3cfca03/55eea23337f14fc2bb494ab72e156006 [2023-12-25 01:46:49,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:46:49,721 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:46:49,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:46:49,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:46:49,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:46:49,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11438d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49, skipping insertion in model container [2023-12-25 01:46:49,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:46:49,846 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/egcd2-ll_valuebound2.c[490,503] [2023-12-25 01:46:49,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:46:49,870 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:46:49,886 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/egcd2-ll_valuebound2.c[490,503] [2023-12-25 01:46:49,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:46:49,903 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:46:49,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49 WrapperNode [2023-12-25 01:46:49,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:46:49,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:46:49,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:46:49,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:46:49,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,932 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-12-25 01:46:49,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:46:49,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:46:49,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:46:49,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:46:49,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,951 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:46:49,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:46:49,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:46:49,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:46:49,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:46:49,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (1/1) ... [2023-12-25 01:46:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:46:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:46:49,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:46:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:46:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:46:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:46:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:46:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:46:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:46:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:46:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:46:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:46:50,070 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:46:50,072 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:46:50,574 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:46:50,591 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:46:50,591 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:46:50,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:46:50 BoogieIcfgContainer [2023-12-25 01:46:50,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:46:50,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:46:50,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:46:50,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:46:50,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:46:49" (1/3) ... [2023-12-25 01:46:50,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de5d3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:46:50, skipping insertion in model container [2023-12-25 01:46:50,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:46:49" (2/3) ... [2023-12-25 01:46:50,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de5d3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:46:50, skipping insertion in model container [2023-12-25 01:46:50,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:46:50" (3/3) ... [2023-12-25 01:46:50,598 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound2.c [2023-12-25 01:46:50,610 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:46:50,610 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:46:50,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:46:50,649 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;@5215bdbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:46:50,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:46:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 16 states have (on average 1.5625) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:46:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:46:50,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:50,661 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:50,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:50,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1865535902, now seen corresponding path program 1 times [2023-12-25 01:46:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875201515] [2023-12-25 01:46:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:50,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:46:50,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:46:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:50,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:46:50,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 01:46:50,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:46:50,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875201515] [2023-12-25 01:46:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875201515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:46:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:46:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:46:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734217956] [2023-12-25 01:46:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:46:50,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:46:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:46:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:46:50,986 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.5625) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:46:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:46:51,022 INFO L93 Difference]: Finished difference Result 62 states and 107 transitions. [2023-12-25 01:46:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:46:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-25 01:46:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:46:51,030 INFO L225 Difference]: With dead ends: 62 [2023-12-25 01:46:51,030 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 01:46:51,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:46:51,036 INFO L413 NwaCegarLoop]: 41 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, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:46:51,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:46:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 01:46:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 01:46:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:46:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-12-25 01:46:51,068 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 38 [2023-12-25 01:46:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:46:51,069 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-12-25 01:46:51,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:46:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-12-25 01:46:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 01:46:51,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:51,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:51,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:46:51,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:51,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:51,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -279596905, now seen corresponding path program 1 times [2023-12-25 01:46:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595531356] [2023-12-25 01:46:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:51,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:46:51,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:46:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:51,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:46:51,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:46:51,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:46:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 01:46:51,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595531356] [2023-12-25 01:46:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595531356] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:46:51,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:46:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2023-12-25 01:46:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533897034] [2023-12-25 01:46:51,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:46:51,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:46:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:46:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:46:51,975 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 01:46:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:46:54,470 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-12-25 01:46:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 01:46:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 39 [2023-12-25 01:46:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:46:54,472 INFO L225 Difference]: With dead ends: 47 [2023-12-25 01:46:54,472 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 01:46:54,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:46:54,473 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:46:54,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 171 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 01:46:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 01:46:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 01:46:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:46:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-12-25 01:46:54,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 39 [2023-12-25 01:46:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:46:54,481 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-12-25 01:46:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 01:46:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-12-25 01:46:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 01:46:54,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:54,482 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:54,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 01:46:54,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:54,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:54,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -76887146, now seen corresponding path program 1 times [2023-12-25 01:46:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023641924] [2023-12-25 01:46:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:54,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:54,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:46:54,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:46:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:54,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 01:46:54,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 01:46:55,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:46:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:46:58,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023641924] [2023-12-25 01:46:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023641924] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:46:58,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:46:58,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-25 01:46:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595323862] [2023-12-25 01:46:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:46:58,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:46:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:46:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:46:58,920 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 01:47:02,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:06,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:08,676 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-25 01:47:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:47:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2023-12-25 01:47:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:08,687 INFO L225 Difference]: With dead ends: 45 [2023-12-25 01:47:08,688 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 01:47:08,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:47:08,689 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:08,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2023-12-25 01:47:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 01:47:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2023-12-25 01:47:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:47:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2023-12-25 01:47:08,697 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 40 [2023-12-25 01:47:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:08,697 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2023-12-25 01:47:08,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 01:47:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2023-12-25 01:47:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 01:47:08,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:08,698 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:08,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:08,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:08,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:08,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 345761675, now seen corresponding path program 1 times [2023-12-25 01:47:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370581287] [2023-12-25 01:47:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:08,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:08,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:08,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:47:08,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:47:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:09,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:47:09,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 01:47:10,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:47:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:47:17,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:47:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370581287] [2023-12-25 01:47:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370581287] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:47:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:47:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:47:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882656108] [2023-12-25 01:47:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:47:17,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:47:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:47:17,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:47:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:47:17,451 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:47:21,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:24,012 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-12-25 01:47:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:47:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-12-25 01:47:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:24,029 INFO L225 Difference]: With dead ends: 53 [2023-12-25 01:47:24,029 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 01:47:24,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:47:24,030 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:24,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 136 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-25 01:47:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 01:47:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-25 01:47:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:47:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2023-12-25 01:47:24,039 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 45 [2023-12-25 01:47:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:24,040 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2023-12-25 01:47:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:47:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2023-12-25 01:47:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 01:47:24,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:24,041 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:24,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:24,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:24,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:24,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash -954985354, now seen corresponding path program 1 times [2023-12-25 01:47:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438144452] [2023-12-25 01:47:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:24,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:47:24,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:47:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:24,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 01:47:24,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 01:47:25,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:47:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:47:40,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:47:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438144452] [2023-12-25 01:47:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438144452] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:47:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:47:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-25 01:47:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298486127] [2023-12-25 01:47:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:47:40,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:47:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:47:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:47:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:47:40,075 INFO L87 Difference]: Start difference. First operand 50 states and 66 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 01:47:45,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:51,016 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-12-25 01:47:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 01:47:51,033 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 01:47:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:51,034 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:47:51,034 INFO L226 Difference]: Without dead ends: 55 [2023-12-25 01:47:51,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:47:51,035 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:51,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-12-25 01:47:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-25 01:47:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-12-25 01:47:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:47:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2023-12-25 01:47:51,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 50 [2023-12-25 01:47:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:51,063 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2023-12-25 01:47:51,063 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 01:47:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2023-12-25 01:47:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 01:47:51,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:51,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:51,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:51,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:51,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2047387093, now seen corresponding path program 1 times [2023-12-25 01:47:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865993205] [2023-12-25 01:47:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:51,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:47:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:51,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:47:51,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:47:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:51,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:47:51,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 01:47:57,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:48:19,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:48:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865993205] [2023-12-25 01:48:19,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865993205] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 01:48:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [615115540] [2023-12-25 01:48:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:48:19,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 01:48:19,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 01:48:19,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 01:48:19,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 01:48:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:48:20,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:48:20,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:48:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:48:37,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:48:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [615115540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:48:37,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:48:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-25 01:48:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636524496] [2023-12-25 01:48:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:48:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:48:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:48:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:48:37,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:48:37,617 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 01:48:39,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:46,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:48:46,556 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2023-12-25 01:48:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:48:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2023-12-25 01:48:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:48:46,573 INFO L225 Difference]: With dead ends: 61 [2023-12-25 01:48:46,573 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 01:48:46,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:48:46,574 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:48:46,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-25 01:48:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 01:48:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-12-25 01:48:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:48:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-12-25 01:48:46,587 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 55 [2023-12-25 01:48:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:48:46,588 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-12-25 01:48:46,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 01:48:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-12-25 01:48:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 01:48:46,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:48:46,589 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:48:46,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:48:46,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-25 01:48:46,991 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 01:48:46,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:48:46,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:48:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1705825109, now seen corresponding path program 1 times [2023-12-25 01:48:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:48:46,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021797514] [2023-12-25 01:48:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:48:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:48:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:48:46,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:48:46,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:48:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:48:47,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:48:47,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:48:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-25 01:48:50,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:48:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 01:48:59,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:48:59,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021797514] [2023-12-25 01:48:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021797514] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:48:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:48:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2023-12-25 01:48:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034869165] [2023-12-25 01:48:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:48:59,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:48:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:48:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:48:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:48:59,349 INFO L87 Difference]: Start difference. First operand 58 states and 72 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 01:49:03,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:49:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:49:06,054 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2023-12-25 01:49:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:49:06,076 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-12-25 01:49:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:49:06,077 INFO L225 Difference]: With dead ends: 64 [2023-12-25 01:49:06,077 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 01:49:06,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:49:06,078 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:49:06,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-25 01:49:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 01:49:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-12-25 01:49:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 01:49:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-12-25 01:49:06,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 62 [2023-12-25 01:49:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:49:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-12-25 01:49:06,091 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 01:49:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-12-25 01:49:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 01:49:06,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:49:06,092 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:49:06,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:49:06,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:49:06,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:49:06,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:49:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 392643903, now seen corresponding path program 1 times [2023-12-25 01:49:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:49:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900381821] [2023-12-25 01:49:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:49:06,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:49:06,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:49:06,297 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:49:06,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:49:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:49:06,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:49:06,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:49:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:49:07,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:49:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-25 01:49:08,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:49:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900381821] [2023-12-25 01:49:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900381821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:49:08,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:49:08,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-25 01:49:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959930097] [2023-12-25 01:49:08,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:49:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:49:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:49:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:49:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:49:08,575 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 01:49:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:49:18,427 INFO L93 Difference]: Finished difference Result 113 states and 160 transitions. [2023-12-25 01:49:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 01:49:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 64 [2023-12-25 01:49:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:49:18,449 INFO L225 Difference]: With dead ends: 113 [2023-12-25 01:49:18,449 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 01:49:18,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-12-25 01:49:18,450 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 153 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:49:18,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 297 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-12-25 01:49:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 01:49:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 69. [2023-12-25 01:49:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 01:49:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2023-12-25 01:49:18,474 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 64 [2023-12-25 01:49:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:49:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-12-25 01:49:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 01:49:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2023-12-25 01:49:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 01:49:18,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:49:18,478 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2023-12-25 01:49:18,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:49:18,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:49:18,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:49:18,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:49:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -45785549, now seen corresponding path program 1 times [2023-12-25 01:49:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:49:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088540362] [2023-12-25 01:49:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:49:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:49:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:49:18,694 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:49:18,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:49:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:49:19,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 01:49:19,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:49:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 01:49:21,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:49:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-25 01:49:58,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:49:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088540362] [2023-12-25 01:49:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088540362] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:49:58,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:49:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2023-12-25 01:49:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860386051] [2023-12-25 01:49:58,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:49:58,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 01:49:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:49:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 01:49:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:49:58,270 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2023-12-25 01:50:15,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:34,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:51:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:51:12,453 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2023-12-25 01:51:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 01:51:12,478 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) Word has length 70 [2023-12-25 01:51:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:51:12,479 INFO L225 Difference]: With dead ends: 117 [2023-12-25 01:51:12,479 INFO L226 Difference]: Without dead ends: 114 [2023-12-25 01:51:12,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 01:51:12,480 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:51:12,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 294 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 302 Invalid, 1 Unknown, 0 Unchecked, 31.8s Time] [2023-12-25 01:51:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-25 01:51:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2023-12-25 01:51:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 61 states have internal predecessors, (69), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 01:51:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2023-12-25 01:51:12,502 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 70 [2023-12-25 01:51:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:51:12,502 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2023-12-25 01:51:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 15 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2023-12-25 01:51:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2023-12-25 01:51:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 01:51:12,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:51:12,503 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2023-12-25 01:51:12,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:51:12,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:51:12,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:51:12,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:51:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1519552206, now seen corresponding path program 2 times [2023-12-25 01:51:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:51:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219373792] [2023-12-25 01:51:12,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:51:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:51:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:51:12,714 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:51:12,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 01:51:13,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:51:13,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:51:13,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 01:51:13,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:51:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-25 01:51:15,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:52:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 01:52:46,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:52:46,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219373792] [2023-12-25 01:52:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219373792] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:52:46,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:52:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2023-12-25 01:52:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55556459] [2023-12-25 01:52:46,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:52:46,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:52:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:52:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:52:46,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:52:46,255 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 14 states have internal predecessors, (35), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2023-12-25 01:52:47,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:55,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:57,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:59,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:00,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:09,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:16,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:32,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:36,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:41,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:53:46,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:54:20,280 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:54:25,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:54:30,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:55:07,921 WARN L293 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:55:09,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:55:13,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:55:17,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:55:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:55:32,754 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2023-12-25 01:55:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 01:55:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 14 states have internal predecessors, (35), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 75 [2023-12-25 01:55:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:55:32,821 INFO L225 Difference]: With dead ends: 174 [2023-12-25 01:55:32,821 INFO L226 Difference]: Without dead ends: 172 [2023-12-25 01:55:32,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 148.9s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2023-12-25 01:55:32,825 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 198 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 176 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:55:32,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 272 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 67.2s Time] [2023-12-25 01:55:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-25 01:55:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2023-12-25 01:55:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 87 states have internal predecessors, (100), 53 states have call successors, (53), 10 states have call predecessors, (53), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-25 01:55:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2023-12-25 01:55:32,874 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 75 [2023-12-25 01:55:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:55:32,874 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2023-12-25 01:55:32,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 14 states have internal predecessors, (35), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2023-12-25 01:55:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2023-12-25 01:55:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 01:55:32,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:55:32,876 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 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, 1, 1, 1] [2023-12-25 01:55:32,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:55:33,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:55:33,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:55:33,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:55:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1881497901, now seen corresponding path program 3 times [2023-12-25 01:55:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:55:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874744882] [2023-12-25 01:55:33,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:55:33,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:55:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:55:33,097 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:55:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 01:55:33,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 01:55:33,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:55:33,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 01:55:33,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:56:09,940 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:56:21,336 WARN L293 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:57:19,515 WARN L293 SmtUtils]: Spent 19.05s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:57:47,004 WARN L293 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:57:56,979 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:58:06,242 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:58:22,919 WARN L293 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:58:32,253 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:58:41,684 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:58:56,329 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:59:01,644 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:59:09,748 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:59:16,016 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:59:31,194 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:59:40,064 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:00:05,343 WARN L293 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:00:26,112 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:00:58,304 WARN L293 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 02:01:32,851 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:01:32,851 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:01:33,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 02:01:34,052 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 02:01:34,084 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 137 [2023-12-25 02:01:34,086 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:01:34,086 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-25 02:01:34,089 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:01:34,091 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:01:34,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:01:34 BoogieIcfgContainer [2023-12-25 02:01:34,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:01:34,092 INFO L158 Benchmark]: Toolchain (without parser) took 884371.95ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 138.0MB in the beginning and 183.3MB in the end (delta: -45.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:01:34,092 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 188.7MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:01:34,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.45ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 125.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 02:01:34,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.93ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:01:34,093 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 188.7MB. Free memory was 124.2MB in the beginning and 122.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:01:34,093 INFO L158 Benchmark]: RCFGBuilder took 629.09ms. Allocated memory is still 188.7MB. Free memory was 122.3MB in the beginning and 108.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 02:01:34,093 INFO L158 Benchmark]: TraceAbstraction took 883498.93ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 107.3MB in the beginning and 183.3MB in the end (delta: -76.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:01:34,094 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.47ms. Allocated memory is still 188.7MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.45ms. Allocated memory is still 188.7MB. Free memory was 138.0MB in the beginning and 125.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.93ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 188.7MB. Free memory was 124.2MB in the beginning and 122.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 629.09ms. Allocated memory is still 188.7MB. Free memory was 122.3MB in the beginning and 108.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 883498.93ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 107.3MB in the beginning and 183.3MB in the end (delta: -76.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.5s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 296.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 149.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 1711 SdHoareTripleChecker+Invalid, 137.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1355 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 986 IncrementalHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 356 mSDtfsCounter, 986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 909 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 265.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 91 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 219.4s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1019 ConstructedInterpolants, 35 QuantifiedInterpolants, 4949 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1062 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1339/1598 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown